Edge Correlations in Random Regular Hypergraphs and Applications to Subgraph Testing
DOI10.1137/18M1177159zbMath1425.05102arXiv1803.09223OpenAlexW2977682366WikidataQ127180047 ScholiaQ127180047MaRDI QIDQ5237911
Daniela Kühn, Alberto Espuny Díaz, Deryk Osthus, Felix Joos
Publication date: 25 October 2019
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.09223
Analysis of algorithms and problem complexity (68Q25) Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Enumeration in graph theory (05C30) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity
- On extremal hypergraphs for Hamiltonian cycles
- On the number of Hamilton cycles in pseudo-random graphs
- Small subgraphs of random regular graphs
- Every minor-closed property of sparse graphs is testable
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Sandwiching random graphs: universality between random graph models
- A threshold result for loose Hamiltonicity in random regular uniform hypergraphs
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Every Property of Hyperfinite Graphs Is Testable
- Random Regular Graphs of Non-Constant Degree: Connectivity and Hamiltonicity
- Property testing and its connection to learning and approximation
- Uniform generation of random regular graphs of moderate degree
- Testing Triangle-Freeness in General Graphs
- Almost all cubic graphs are Hamiltonian
- Almost all regular graphs are hamiltonian
- The Numbers of Spanning Trees, Hamilton Cycles and Perfect Matchings in a Random Graph
- Spanning Subgraphs of Random Graphs
- Regularity Lemma for k-uniform hypergraphs
- Random Regular Graphs: Asymptotic Distributions and Contiguity
- Tight Hamilton cycles in random uniform hypergraphs
- A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity
- Edge Correlations in Random Regular Hypergraphs and Applications to Subgraph Testing
- On the Number of Hamilton Cycles in Sparse Random Graphs
- Loose Hamilton Cycles in Regular Hypergraphs
- Regular Partitions of Hypergraphs: Regularity Lemmas
- Regular Partitions of Hypergraphs: Counting Lemmas
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
This page was built for publication: Edge Correlations in Random Regular Hypergraphs and Applications to Subgraph Testing
