Counting results for sparse pseudorandom hypergraphs. I.

DOI10.1016/j.ejc.2017.04.008zbMath1369.05111DBLPjournals/ejc/KohayakawaMST17arXiv1602.08782OpenAlexW4207003154WikidataQ102054515 ScholiaQ102054515MaRDI QIDQ2400983

Guilherme Oliveira Mota, Yoshiharu Kohayakawa, Mathias Schacht, Anusch Taraz

Publication date: 31 August 2017

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1602.08782

zbMATH Keywords

counting lemma

Mathematics Subject Classification ID

Hypergraphs (05C65) Enumeration in graph theory (05C30) Density (toughness, etc.) (05C42)

Related Items (2)

Counting results for sparse pseudorandom hypergraphs. II. ⋮ Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs

Cites Work

• On universality of graphs with uniformly distributed edges
• Sparse quasi-random graphs
• Embedding graphs with bounded degree in sparse pseudorandom graphs
• A relative Szemerédi theorem
• Counting results for sparse pseudorandom hypergraphs. II.
• Extremal results in sparse pseudorandom graphs
• On the Edge Distribution of a Graph
• Packing tight Hamilton cycles in 3-uniform hypergraphs
• Packing hamilton cycles in random and pseudo-random hypergraphs
• Quasi‐random graphs with given degree sequences
• Quasi-random graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Counting results for sparse pseudorandom hypergraphs. I.