Trees and graphs: congestion, polynomials and reconstruction
<p>Spanning tree congestion was defined by Ostrovskii (2004) as a measure of how well a network can perform if only minimal connection can be maintained. We compute the parameter for several families of graphs. In particular, by partitioning a hypercube into pieces with almost optimal edge-bou...
| Hovedforfatter: | |
|---|---|
| Andre forfattere: | |
| Format: | Thesis |
| Sprog: | English |
| Udgivet: |
2011
|
| Fag: |
| _version_ | 1826316711297548288 |
|---|---|
| author | Law, H |
| author2 | Scott, A |
| author_facet | Scott, A Law, H |
| author_sort | Law, H |
| collection | OXFORD |
| description | <p>Spanning tree congestion was defined by Ostrovskii (2004) as a measure of how well a network can perform if only minimal connection can be maintained. We compute the parameter for several families of graphs. In particular, by partitioning a hypercube into pieces with almost optimal edge-boundaries, we give tight estimates of the parameter thereby disproving a conjecture of Hruska (2008). For a typical random graph, the parameter exhibits a zigzag behaviour reflecting the feature that it is not monotone in the number of edges. This motivates the study of the most congested graphs where we show that any graph is close to a graph with small congestion.</p><p>Next, we enumerate independent sets. Using the independent set polynomial, we compute the extrema of averages in trees and graphs. Furthermore, we consider inverse problems among trees and resolve a conjecture of Wagner (2009). A result in a more general setting is also proved which answers a question of Alon, Haber and Krivelevich (2011).</p><p>After briefly considering polynomial invariants of general graphs, we specialize into trees. Three levels of tree distinguishing power are exhibited. We show that polynomials which do not distinguish rooted trees define typically exponentially large equivalence classes. On the other hand, we prove that the rooted Ising polynomial distinguishes rooted trees and that the Negami polynomial determines the subtree polynomial, strengthening results of Bollobás and Riordan (2000) and Martin, Morin and Wagner (2008). The top level consists of the chromatic symmetric function and it is proved to be a complete invariant for caterpillars.</p> |
| first_indexed | 2024-03-06T22:18:05Z |
| format | Thesis |
| id | oxford-uuid:54190b51-cd9d-489e-a79e-82ecdf15b4c5 |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-12-09T03:49:53Z |
| publishDate | 2011 |
| record_format | dspace |
| spelling | oxford-uuid:54190b51-cd9d-489e-a79e-82ecdf15b4c52024-12-08T13:12:06ZTrees and graphs: congestion, polynomials and reconstructionThesishttp://purl.org/coar/resource_type/c_db06uuid:54190b51-cd9d-489e-a79e-82ecdf15b4c5CombinatoricsEnglishOxford University Research Archive - Valet2011Law, HScott, A<p>Spanning tree congestion was defined by Ostrovskii (2004) as a measure of how well a network can perform if only minimal connection can be maintained. We compute the parameter for several families of graphs. In particular, by partitioning a hypercube into pieces with almost optimal edge-boundaries, we give tight estimates of the parameter thereby disproving a conjecture of Hruska (2008). For a typical random graph, the parameter exhibits a zigzag behaviour reflecting the feature that it is not monotone in the number of edges. This motivates the study of the most congested graphs where we show that any graph is close to a graph with small congestion.</p><p>Next, we enumerate independent sets. Using the independent set polynomial, we compute the extrema of averages in trees and graphs. Furthermore, we consider inverse problems among trees and resolve a conjecture of Wagner (2009). A result in a more general setting is also proved which answers a question of Alon, Haber and Krivelevich (2011).</p><p>After briefly considering polynomial invariants of general graphs, we specialize into trees. Three levels of tree distinguishing power are exhibited. We show that polynomials which do not distinguish rooted trees define typically exponentially large equivalence classes. On the other hand, we prove that the rooted Ising polynomial distinguishes rooted trees and that the Negami polynomial determines the subtree polynomial, strengthening results of Bollobás and Riordan (2000) and Martin, Morin and Wagner (2008). The top level consists of the chromatic symmetric function and it is proved to be a complete invariant for caterpillars.</p> |
| spellingShingle | Combinatorics Law, H Trees and graphs: congestion, polynomials and reconstruction |
| title | Trees and graphs: congestion, polynomials and reconstruction |
| title_full | Trees and graphs: congestion, polynomials and reconstruction |
| title_fullStr | Trees and graphs: congestion, polynomials and reconstruction |
| title_full_unstemmed | Trees and graphs: congestion, polynomials and reconstruction |
| title_short | Trees and graphs: congestion, polynomials and reconstruction |
| title_sort | trees and graphs congestion polynomials and reconstruction |
| topic | Combinatorics |
| work_keys_str_mv | AT lawh treesandgraphscongestionpolynomialsandreconstruction |