| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4664245 | Acta Mathematica Scientia | 2011 | 7 Pages |
Abstract
The first problem considered in this article reads: is it possible to find upper estimates for the spanning tree congestion in bipartite graphs, which are better than those for general graphs? It is proved that there exists a bipartite version of the known graph with spanning tree congestion of order n3/2, where n is the number of vertices. The second problem is to estimate spanning tree congestion of random graphs. It is proved that the standard model of random graphs cannot be used to find graphs whose spanning tree congestion has order greater than n3/2.
Related Topics
Physical Sciences and Engineering
Mathematics
Mathematics (General)
