Counting Small Cliques in 3-uniform Hypergraphs

DOI10.1017/S0963548304006546zbMATH Open1064.05107OpenAlexW2163921185MaRDI QIDQ4680574FDOQ4680574

Authors: Vojtěch Rödl, J. Skokan, Yuejian Peng 

Publication date: 7 June 2005

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548304006546

Recommendations

• Note on the 3-graph counting Lemma
• The counting lemma for regular k‐uniform hypergraphs
• Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
• Regularity properties for triple systems
• Counting results for sparse pseudorandom hypergraphs. II.

zbMATH Keywords

regularity lemmacounting lemmaquasi-randomness

Mathematics Subject Classification ID

Hypergraphs (05C65)

Cited In (9)

• Regularity properties for triple systems
• On characterizing hypergraph regularity
• Finding and counting cliques and independent sets in \(r\)-uniform hypergraphs
• Counting in hypergraphs via regularity inheritance
• Counting subgraphs in quasi‐random 4‐uniform hypergraphs
• Title not available (Why is that?)
• Note on the 3-graph counting Lemma
• Counting results for sparse pseudorandom hypergraphs. I.
• Counting results for sparse pseudorandom hypergraphs. II.

This page was built for publication: Counting Small Cliques in 3-uniform Hypergraphs

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