Forcing large tight components in 3-graphs
From MaRDI portal
Publication:1715624
DOI10.1016/j.ejc.2018.11.001zbMath1404.05033arXiv1801.01074OpenAlexW2781566485WikidataQ128888723 ScholiaQ128888723MaRDI QIDQ1715624
John Haslegrave, Richard Montgomery, Angelos Georgakopoulos
Publication date: 29 January 2019
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1801.01074
Related Items (5)
Generalizations and strengthenings of Ryser's conjecture ⋮ Minimum Degrees for Powers of Paths and Cycles ⋮ Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths ⋮ Large monochromatic components in colorings of complete hypergraphs ⋮ A universal exponent for homeomorphs
Cites Work
- Tight cycles and regular slices in dense hypergraphs
- Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs
- Hypergraph extensions of the Erdős-Gallai theorem
- Homological connectivity of random 2-complexes
- Maximum degree and fractional matchings in uniform hypergraphs
- The Non-Existence of Finite Projective Planes of Order 10
- Filling the gap between Turán's theorem and Pósa's conjecture
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- Inside the critical window for cohomology of random k -complexes
- Homological connectivity of random k -dimensional complexes
- Hamiltonian chains in hypergraphs
- The size of the giant high‐order component in random hypergraphs
- Largest Components in Random Hypergraphs
- The Nonexistence of Certain Finite Projective Planes
This page was built for publication: Forcing large tight components in 3-graphs
