A counting lemma for sparse pseudorandom hypergraphs
From MaRDI portal
Publication:324872
DOI10.1016/j.endm.2015.07.070zbMath1347.05132OpenAlexW2217780633WikidataQ101496303 ScholiaQ101496303MaRDI QIDQ324872
Anusch Taraz, Mathias Schacht, Yoshiharu Kohayakawa, Guilherme Oliveira Mota
Publication date: 17 October 2016
Full work available at URL: https://doi.org/10.1016/j.endm.2015.07.070
Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Density (toughness, etc.) (05C42)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On universality of graphs with uniformly distributed edges
- Embedding graphs with bounded degree in sparse pseudorandom graphs
- Extremal results in sparse pseudorandom graphs
- Packing tight Hamilton cycles in 3-uniform hypergraphs
- Packing hamilton cycles in random and pseudo-random hypergraphs
- Quasi-random graphs