Counting subgraphs in quasi‐random 4‐uniform hypergraphs

DOI10.1002/rsa.20056zbMath1063.05069OpenAlexW2528769944MaRDI QIDQ4667862

Jozef Skokan, Vojtěch Rödl

Publication date: 21 April 2005

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20056

zbMATH Keywords

regularity lemmacounting lemma

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Enumeration in graph theory (05C30)

Related Items

Sparse hypergraphs: new bounds and constructions, Quasi-random hypergraphs revisited

Cites Work

• Unnamed Item
• The uniformity lemma for hypergraphs
• Ramsey properties of random hypergraphs
• Regularity lemmas for hypergraphs and quasi-randomness
• Regularity properties for triple systems
• Counting Small Cliques in 3-uniform Hypergraphs
• On characterizing hypergraph regularity
• Hereditary Properties of Triple Systems
• Regularity Lemma for k-uniform hypergraphs
• The asymptotic number of triple systems not containing a fixed one