The circumference of a graph with no K3, t-minor
نویسندگان
چکیده
The class of graphs with no K3,t-minors, t ≥ 3, contains all planar graphs and plays an important role in graph minor theory. In 1992, Seymour and Thomas conjectured the existence of a function α(t) > 0 and a constant β > 0, such that every 3-connected n-vertex graph with no K3,t-minors, t ≥ 3, contains a cycle of length at least α(t)n . The purpose of this paper is to confirm this conjecture with α(t) = (1/2)t(t−1) and β = log1729 2. ∗Supported in part by NSA and by NSFC Project 10628102 †Supported in part by the Research Grants Council of Hong Kong and Seed Funding for Basic Research of HKU.
منابع مشابه
Dense graphs have K3, t minors
Let K ∗ 3,t denote the graph obtained from K3,t by adding all edges between the three vertices of degree t in it. We prove that for each t ≥ 6300 and n ≥ t + 3, each n-vertex graph G with e(G) > 1 2 (t + 3)(n− 2)+ 1 has a K ∗ 3,t -minor. The bound is sharp in the sense that for every t , there are infinitely many graphs Gwith e(G) = 2 (t+ 3)(|V (G)|− 2)+ 1 that have no K3,t -minor. The result c...
متن کاملLarge Wk- or K3, t-Minors in 3-Connected Graphs
There are numerous results bounding the circumference of certain 3connected graphs. There is no good bound on the size of the largest bond (cocircuit) of a 3-connected graph, however. Oporowski, Oxley and Thomas [11] proved the following result in 1993. For every positive integer k, there is an integer n = f(k) such that every 3-connected graph with at least n vertices contains a Wkor K3,kminor...
متن کاملSpanning trees in 3-connected K3, t-minor-free graphs
In this paper, we show that for any even integer t ≥ 4, every 3-connected graph with no K3,t-minor has a spanning tree whose maximum degree is at most t − 1. This result is a common generalization of the result by Barnette [1] and the one by Chen, Egawa, Kawarabayashi, Mohar and Ota [4].
متن کاملA Characterization of Graphs with No Octahedron Minor
It is proved that a graph does not contain an octahedron minor if and only if it is constructed from {K1,K2,K3,K4}∪{C 2 2n−1 : n ≥ 3} and five other internally 4-connected graphs by 0-, 1-, 2-, and 3-sums.
متن کاملForbidden directed minors and Kelly-width
Partial 1-trees are undirected graphs of treewidth at most one. Similarly, partial 1-DAGs are directed graphs of KellyWidth at most two. It is well-known that an undirected graph is a partial 1-tree if and only if it has no K3 minor. In this paper, we generalize this characterization to partial 1-DAGs. We show that partial 1-DAGs are characterized by three forbidden directed minors, K3, N4 and M5.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 96 شماره
صفحات -
تاریخ انتشار 2006