Remarks on a Conjecture of Barát and Tóth
نویسندگان
چکیده
In 2010, Barát and Tóth verified that any r-critical graph with at most r + 4 vertices has a subdivision of Kr. Based in this result, the authors conjectured that, for every positive integer c, there exists a bound r(c) such that for any r, where r > r(c), any r-critical graph on r+ c vertices has a subdivision of Kr. In this note, we verify the validity of this conjecture for c = 5, and show counterexamples for all c > 6.
منابع مشابه
Towards the Albertson Conjecture
Albertson conjectured that if a graph G has chromatic number r, then the crossing number of G is at least as large as the crossing number of Kr, the complete graph on r vertices. Albertson, Cranston, and Fox verified the conjecture for r 6 12. In this paper we prove it for r 6 16. Dedicated to the memory of Michael O. Albertson.
متن کاملA proof of the Barát-Thomassen conjecture
The Barát-Thomassen conjecture asserts that for every tree T on m edges, there exists a constant kT such that every kT -edge-connected graph with size divisible by m can be edge-decomposed into copies of T . So far this conjecture has only been verified when T is a path or when T has diameter at most 4. Here we prove the full statement of the conjecture.
متن کاملDisproof of the List Hadwiger Conjecture
The List Hadwiger Conjecture asserts that every Kt-minor-free graph is tchoosable. We disprove this conjecture by constructing a K3t+2-minor-free graph that is not 4t-choosable for every integer t ≥ 1.
متن کامل1 1 O ct 2 01 1 Disproof of the List Hadwiger Conjecture
The List Hadwiger Conjecture asserts that every Kt-minor-free graph is t-choosable. We disprove this conjecture by constructing a K3t+2-minor-free graph that is not 4tchoosable for every integer t ≥ 1.
متن کاملDecomposing Highly Connected Graphs into Paths of Length Five
Barát and Thomassen (2006) posed the following decomposition conjecture: for each tree T , there exists a natural number kT such that, if G is a kT -edge-connected graph and |E(G)| is divisible by |E(T )|, then G admits a decomposition into copies of T . In a series of papers, Thomassen verified this conjecture for stars, some bistars, paths of length 3, and paths whose length is a power of 2. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 21 شماره
صفحات -
تاریخ انتشار 2014