论文信息 - The edge-density for K2, t minors

The edge-density for K2, t minors

Let H be a graph. If G is an n-vertex simple graph that does not contain H as a minor, what is the maximum number of edges that G can have? This is at most linear in n, but the exact expression is known only for very few graphs H. For instance, when H is a complete graph K"t, the ''natural'' conjecture, (t-2)n-12(t-1)@?(t-2), is true only for t= =2) the truth for infinitely many n.

[1] W. Mader. Homomorphiesätze für Graphen , 1968 .

[2] Robin Thomas,et al. Typical Subgraphs of 3- and 4-Connected Graphs , 1993, J. Comb. Theory, Ser. B.

[3] Paul D. Seymour,et al. Graph minors. V. Excluding a planar graph , 1986, J. Comb. Theory B.

[4] W. Mader. Homomorphieeigenschaften und mittlere Kantendichte von Graphen , 1967 .

[5] Joseph Samuel Myers,et al. The extremal function for unbalanced bipartite minors , 2003, Discret. Math..

[6] A. Thomason. An extremal function for contractions of graphs , 1984, Mathematical Proceedings of the Cambridge Philosophical Society.

[7] P. Seymour,et al. Spanning trees with many leaves , 2001 .

[8] Alexandr V. Kostochka,et al. Lower bound of the hadwiger number of graphs by their average degree , 1984, Comb..

[9] Andrew Thomason,et al. The Extremal Function for Complete Minors , 2001, J. Comb. Theory B.

[10] Robin Thomas,et al. A menger-like property of tree-width: The finite case , 1990, J. Comb. Theory, Ser. B.

[11] Alexandr V. Kostochka,et al. On Ks, t-minors in graphs with given average degree , 2008, Discret. Math..

[12] A. Kostochka. The minimum Hadwiger number for graphs with a given mean degree of vertices , 1982 .