Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs
From MaRDI portal
Publication:6074706
DOI10.1002/rsa.21052zbMath1522.05263OpenAlexW3205572417MaRDI QIDQ6074706
Jie Han, Hiệp Hàn, Patrick Morris
Publication date: 12 October 2023
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.21052
Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Perfect packings in quasirandom hypergraphs. I.
- Triangle factors in sparse pseudo-random graphs
- Powers of Hamilton cycles in pseudorandom graphs
- Turán's theorem for pseudo-random graphs
- Weak hypergraph regularity and linear hypergraphs
- Dirac-type results for loose Hamilton cycles in uniform hypergraphs
- Explicit Ramsey graphs and orthonormal labelings
- Blow-up lemma
- Approximating the independence number via the \(\vartheta\)-function
- Hypergraphs, quasi-randomness, and conditions for regularity
- Pseudo-random hypergraphs
- Some graphs with small second eigenvalue
- On the second eigenvalue of hypergraphs
- Embedding graphs with bounded degree in sparse pseudorandom graphs
- A construction for clique-free pseudorandom graphs
- Clique-factors in sparse pseudorandom graphs
- Spanning trees in random graphs
- A relative Szemerédi theorem
- Counting results for sparse pseudorandom hypergraphs. I.
- Counting results for sparse pseudorandom hypergraphs. II.
- Extremal results in sparse pseudorandom graphs
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Hamilton cycles in quasirandom hypergraphs
- Packing tight Hamilton cycles in 3-uniform hypergraphs
- σ-algebras for quasirandom hypergraphs
- Weak quasi-randomness for uniform hypergraphs
- Quasi-random hypergraphs revisited
- Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- Almost all Steiner triple systems have perfect matchings
- Quasi-random hypergraphs
- Quasi‐random classes of hypergraphs
- Regularity lemmas for hypergraphs and quasi-randomness
- Spanning universality in random graphs
- Regularity Lemma for k-uniform hypergraphs
- On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem
- Triangle‐factors in pseudorandom graphs
- Regularity inheritance in pseudorandom graphs
- Optimal threshold for a random graph to be 2-universal
- The poset of hypergraph quasirandomness
- Regular Partitions of Hypergraphs: Regularity Lemmas
- Regular Partitions of Hypergraphs: Counting Lemmas
- EIGENVALUES AND LINEAR QUASIRANDOM HYPERGRAPHS
- Imbalances in k‐colorations
- Quasi-random graphs
- Quasirandomness in hypergraphs
- Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu
- Finding any given 2‐factor in sparse pseudorandom graphs efficiently
