Tight Codegree Condition for the Existence of Loose Hamilton Cycles in 3-Graphs
نویسندگان
چکیده
In 2006, Kühn and Osthus showed that if a 3-graph H on n vertices has minimum co-degree at least (1/4 + o(1))n and n is even then H has a loose Hamilton cycle. In this paper, we prove that the minimum co-degree of n/4 suffices. The result is tight.
منابع مشابه
The Complexity of the Hamilton Cycle Problem in Hypergraphs of High Minimum Codegree
We consider the complexity of the Hamilton cycle decision problem when restricted to k-uniform hypergraphs H of high minimum codegree δ(H). We show that for tight Hamilton cycles this problem is NP-hard even when restricted to k-uniform hypergraphsH with δ(H) ≥ n2−C, where n is the order of H and C is a constant which depends only on k. This answers a question raised by Karpiński, Ruciński and ...
متن کاملPerfect Matchings, Tilings and Hamilton Cycles in Hypergraphs
This thesis contains problems in finding spanning subgraphs in graphs, such as, perfect matchings, tilings and Hamilton cycles. First, we consider the tiling problems in graphs, which are natural generalizations of the matching problems. We give new proofs of the multipartite Hajnal-Szemerédi Theorem for the tripartite and quadripartite cases. Second, we consider Hamilton cycles in hypergraphs....
متن کاملMinimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs
We investigate minimum vertex degree conditions for 3-uniform hypergraphs which ensure the existence of loose Hamilton cycles. A loose Hamilton cycle is a spanning cycle in which consecutive edges intersect in a single vertex. We prove that every 3-uniform n-vertex (n even) hypergraph H with minimum vertex degree δ1(H) ≥ ( 7 16 + o(1) ) ( n 2 ) contains a loose Hamilton cycle. This bound is asy...
متن کاملMinimum Vertex Degree Conditions for Loose Hamilton Cycles in 3-uniform Hypergraphs
We investigate minimum vertex degree conditions for 3-uniform hypergraphs which ensure the existence of loose Hamilton cycles. A loose Hamilton cycle is a spanning cycle in which consecutive edges intersect in a single vertex. We prove that every 3-uniform n-vertex (n even) hypergraph H with minimum vertex degree δ1(H) ≥ ( 7 16 + o(1) ) (n 2 ) contains a loose Hamilton cycle. This bound is asym...
متن کاملLoose Hamilton Cycles in Regular Hypergraphs
We establish a relation between two uniform models of random k-graphs (for constant k ≥ 3) on n labeled vertices: H(k)(n,m), the random k-graph with exactly m edges, and H(k)(n, d), the random d-regular k-graph. By extending to k-graphs the switching technique of McKay and Wormald, we show that, for some range of d = d(n) and a constant c > 0, if m ∼ cnd, then one can couple H(k)(n,m) and H(k)(...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Discrete Math.
دوره 28 شماره
صفحات -
تاریخ انتشار 2014