Dirac-type theorems in random hypergraphs
From MaRDI portal
Publication:2131868
DOI10.1016/j.jctb.2022.02.009zbMath1487.05243arXiv2006.04370OpenAlexW3033267762MaRDI QIDQ2131868
Publication date: 27 April 2022
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.04370
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extremal results for random discrete structures
- Combinatorial theorems in sparse random sets
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
- On the KŁR conjecture in random graphs
- Bandwidth theorem for random graphs
- Perfect matchings in 4-uniform hypergraphs
- On two Hamilton cycle problems in random graphs
- Weak hypergraph regularity and linear hypergraphs
- Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- Vertex coverings by monochromatic cycles and trees
- On \(K^ 4\)-free subgraphs of random graphs
- Explicit construction of graphs with an arbitrary large girth and of large size
- Thresholds versus fractional expectation-thresholds
- A Dirac-type theorem for Berge cycles in random hypergraphs
- Co-degrees resilience for perfect matchings in random hypergraphs
- Spanning trees in random graphs
- On the decomposition threshold of a given graph
- Hamiltonicity in random graphs is born resilient
- \(F\)-factors in hypergraphs via absorption
- A relative Szemerédi theorem
- The average number of spanning trees in sparse graphs with given degrees
- Robust Hamiltonicity of random directed graphs
- Local resilience for squares of almost spanning cycles in sparse random graphs
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Almost spanning subgraphs of random graphs after adversarial edge removal
- Recent advances on Dirac-type problems for hypergraphs
- Local resilience of almost spanning trees in random graphs
- Dirac's theorem for random graphs
- On the Resilience of Hamiltonicity and Optimal Packing of Hamilton Cycles in Random Graphs
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- Almost all Steiner triple systems have perfect matchings
- Factors in random graphs
- On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
- Local resilience of graphs
- Triangle Factors in Random Graphs
- Hall's theorem for hypergraphs
- Combinatorial theorems relative to a random set
- Local resilience of an almost spanning k‐cycle in random graphs
- Regularity Lemma for k-uniform hypergraphs
- Hamiltonicity in random directed graphs is born resilient
- The Bandwidth Theorem in sparse graphs
- Almost all Steiner triple systems are almost resolvable
- Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs
- On Komlós’ tiling theorem in random graphs
- Resilience of perfect matchings and Hamiltonicity in random graph processes
- Some Theorems on Abstract Graphs
- On the structure of linear graphs
This page was built for publication: Dirac-type theorems in random hypergraphs
