Counting in hypergraphs via regularity inheritance

DOI10.1016/j.endm.2015.06.058zbMath1346.05121OpenAlexW2180800823MaRDI QIDQ322280

Ewan Davies

Publication date: 14 October 2016

Full work available at URL: http://eprints.lse.ac.uk/65062/1/Davies_Counting%20in%20hypergraph.pdf

zbMATH Keywords

counting lemmahypergraph regularityregularity inheritance

Mathematics Subject Classification ID

Hypergraphs (05C65) Enumeration in graph theory (05C30)

Cites Work

• Unnamed Item
• Unnamed Item
• Proof of the bandwidth conjecture of Bollobás and Komlós
• The uniformity lemma for hypergraphs
• Blow-up lemma
• Extremal results in sparse pseudorandom graphs
• A hypergraph blow-up lemma
• Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
• Regularity properties for triple systems
• Extremal problems on set systems
• Counting Small Cliques in 3-uniform Hypergraphs
• On characterizing hypergraph regularity
• Regularity Lemma for k-uniform hypergraphs
• Regular Partitions of Hypergraphs: Regularity Lemmas