Tight cycles and regular slices in dense hypergraphs

DOI10.1016/j.jcta.2017.01.003zbMath1358.05200arXiv1411.4957OpenAlexW2964303076MaRDI QIDQ516070

Yong-Cai Geng, Sumit K. Garg

Publication date: 20 March 2017

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1411.4957

zbMATH Keywords

regularitycycleshypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Paths and cycles (05C38)

Related Items (17)

Hamilton \(\ell\)-cycles in randomly perturbed hypergraphs ⋮ Minimum Degrees for Powers of Paths and Cycles ⋮ Hypergraphs with no tight cycles ⋮ The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph ⋮ Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths ⋮ Hypergraph regularity and random sampling ⋮ Minimum degree conditions for tight Hamilton cycles ⋮ Kalai's conjecture in \(r\)-partite \(r\)-graphs ⋮ Dirac-type conditions for spanning bounded-degree hypertrees ⋮ On Tight Cycles in Hypergraphs ⋮ Forcing large tight components in 3-graphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Covering and tiling hypergraphs with tight cycles ⋮ Longest Paths in Random Hypergraphs ⋮ Hypergraph extensions of the Erdős-Gallai theorem ⋮ Minimum degree of 3-graphs without long linear paths ⋮ Towards Lehel's conjecture for 4-uniform tight cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hamilton cycles in dense vertex-transitive graphs
• Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs
• Hypergraph extensions of the Erdős-Gallai theorem
• An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
• Weak hypergraph regularity and linear hypergraphs
• Hamilton \(\ell \)-cycles in uniform hypergraphs
• Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs
• On a packing and covering problem
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• \(R(C_n,C_n,C_n)\leqq (4+o(1))n\)
• Hypergraphs, quasi-randomness, and conditions for regularity
• Hamiltonicity in balanced \(k\)-partite graphs
• The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph
• Hypergraph regularity and the multidimensional Szemerédi theorem
• Pancyclic graphs. I
• On Hamiltonian bipartite graphs
• The Size of a Hypergraph and its Matching Number
• A hypergraph blow-up lemma
• On maximal paths and circuits of graphs
• The Ramsey Number for 3-Uniform Tight Hypergraph Cycles
• The longest cycle of a graph with a large minimal degree
• Bipartite graphs with cycles of all even lengths
• Regularity lemmas for hypergraphs and quasi-randomness
• Regularity Lemma for k-uniform hypergraphs
• Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs
• Regular Partitions of Hypergraphs: Regularity Lemmas
• Regular Partitions of Hypergraphs: Counting Lemmas
• The counting lemma for regular k‐uniform hypergraphs
• Cycle lengths in graphs with large minimum degree
• Some Theorems on Abstract Graphs

This page was built for publication: Tight cycles and regular slices in dense hypergraphs