Optimal spread for spanning subgraphs of Dirac hypergraphs
From MaRDI portal
Publication:6615765
DOI10.1016/j.jctb.2024.08.006zbMATH Open1548.05248MaRDI QIDQ6615765
Alexey Pokrovskiy, Tom Kelly, Alp Müyesser
Publication date: 8 October 2024
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Cites Work
- Loose Hamilton cycles in random uniform hypergraphs
- Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs
- Hamiltonian cycles in Dirac graphs
- Hamiltonian circuits in random graphs
- On the number of Hamiltonian cycles in Dirac graphs
- Thresholds versus fractional expectation-thresholds
- The minimum degree threshold for perfect graph packings
- Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs
- Are many small sets explicitly small?
- Thresholds and Expectation Thresholds
- Factors in random graphs
- Embedding large subgraphs into dense graphs
- Hamiltonian chains in hypergraphs
- Tight Hamilton cycles in random uniform hypergraphs
- The threshold for the square of a Hamilton cycle
- Robustness of graph properties
- Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs
- Robust Hamiltonicity of Dirac graphs
- On the maximal number of independent circuits in a graph
- Some Theorems on Abstract Graphs
- Counting Hamilton cycles in Dirac hypergraphs
- Proof of the Alon-Yuster conjecture
- Graph colouring and the probabilistic method
- Random cliques in random graphs and sharp thresholds for F$$ F $$‐factors
- A proof of the Kahn–Kalai conjecture
- Counting Hamilton cycles in Dirac hypergraphs
- A general approach to transversal versions of Dirac‐type theorems
- Spanning \(F\)-cycles in random graphs
- A robust Corrádi-Hajnal theorem
Related Items (1)
This page was built for publication: Optimal spread for spanning subgraphs of Dirac hypergraphs
