Densities in graphs and matroids
Certain graphs can be described by the distribution of the edges in its subgraphs. For example, a cycle C is a graph that satisfies |E(H)| |V (H)| < |E(C)| |V (C)| = 1 for all non-trivial subgraphs of C. Similarly, a tree T is a graph that satisfies |E(H)| |V (H)|−1 ≤ |E(T)| |V (T)|−1 = 1 for all...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2010
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1969.1/ETD-TAMU-2533 http://hdl.handle.net/1969.1/ETD-TAMU-2533 |