Counting in hypergraphs via regularity inheritance

DOI10.1016/J.ENDM.2015.06.058MaRDI QIDQ322280zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• The counting lemma for regular k‐uniform hypergraphs
• Regularity properties for triple systems
• Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
• Counting Small Cliques in 3-uniform Hypergraphs
• Regular Partitions of Hypergraphs: Counting Lemmas

Cites work

• scientific article; zbMATH DE number 3641497 (Why is no real title available?)
• A hypergraph blow-up lemma
• Blow-up lemma
• Counting Small Cliques in 3-uniform Hypergraphs
• Extremal problems on set systems
• Extremal results in sparse pseudorandom graphs
• Hypergraph regularity and quasi-randomness
• On characterizing hypergraph regularity
• Proof of the bandwidth conjecture of Bollobás and Komlós
• Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
• Regular Partitions of Hypergraphs: Regularity Lemmas
• Regularity Lemma for k-uniform hypergraphs
• Regularity properties for triple systems
• The uniformity lemma for hypergraphs

Cited in

(2)

• Regular Partitions of Hypergraphs: Counting Lemmas
• Regularity inheritance in pseudorandom graphs

This page was built for publication: Counting in hypergraphs via regularity inheritance

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