A counting lemma for sparse pseudorandom hypergraphs

DOI10.1016/J.ENDM.2015.07.070MaRDI QIDQ324872zbMATH OpenOpenAlexWikidataFDO

Authors M. Schacht, Anusch Taraz, Yoshiharu Kohayakawa, G. O. Mota

Publication date 17 October 2016

Full work available at URL https://doi.org/10.1016/j.endm.2015.07.070

zbMATH Keywords

embeddingshypergraphspseudorandomness

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Density (toughness, etc.) (05C42) Hypergraphs (05C65)

Recommendations

• Counting results for sparse pseudorandom hypergraphs. I.
• Counting results for sparse pseudorandom hypergraphs. II.
• Extremal results in sparse pseudorandom graphs
• Countable sparse random graphs
• A probabilistic counting Lemma for complete graphs
• A probabilistic counting lemma for complete graphs
• Approximate counting of matchings in sparse uniform hypergraphs
• Counting sparse \(k\)-edge-connected hypergraphs with given number of vertices and edges
• Sparse hypergraphs: new bounds and constructions
• Ramsey numbers of sparse hypergraphs

Cites work

• scientific article; zbMATH DE number 5853068 (Why is no real title available?)
• scientific article; zbMATH DE number 3878974 (Why is no real title available?)
• scientific article; zbMATH DE number 3668662 (Why is no real title available?)
• Embedding graphs with bounded degree in sparse pseudorandom graphs
• Extremal results in sparse pseudorandom graphs
• On universality of graphs with uniformly distributed edges
• Packing Hamilton cycles in random and pseudo-random hypergraphs
• Packing tight Hamilton cycles in 3-uniform hypergraphs
• Quasi-random graphs

Cited in

(6)

• scientific article; zbMATH DE number 5853068 (Why is no real title available?)
• \(L_p\) regular sparse hypergraphs: box norms
• A probabilistic counting lemma for complete graphs
• Extremal results in sparse pseudorandom graphs
• Counting results for sparse pseudorandom hypergraphs. I.
• Counting results for sparse pseudorandom hypergraphs. II.

This page was built for publication: A counting lemma for sparse pseudorandom hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q324872)