A counting lemma for sparse pseudorandom hypergraphs

DOI10.1016/J.ENDM.2015.07.070zbMATH Open1347.05132OpenAlexW2217780633WikidataQ101496303 ScholiaQ101496303MaRDI QIDQ324872FDOQ324872

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

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

zbMATH Keywords

embeddingshypergraphspseudorandomness

Mathematics Subject Classification ID

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

Cites Work

• Quasi-random graphs
• On universality of graphs with uniformly distributed edges
• Extremal results in sparse pseudorandom graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Embedding graphs with bounded degree in sparse pseudorandom graphs
• Packing tight Hamilton cycles in 3-uniform hypergraphs
• Packing Hamilton cycles in random and pseudo-random hypergraphs
• Title not available (Why is that?)

Cited In (2)

• Title not available (Why is that?)
• A probabilistic counting lemma for complete graphs

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)