Counting Small Cliques in 3-uniform Hypergraphs
From MaRDI portal
Publication:4680574
DOI10.1017/S0963548304006546zbMath1064.05107OpenAlexW2163921185MaRDI QIDQ4680574
Vojtěch Rödl, Jozef Skokan, Yue Jian 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
Related Items (5)
On characterizing hypergraph regularity ⋮ Counting in hypergraphs via regularity inheritance ⋮ Note on the 3-graph counting Lemma ⋮ Counting subgraphs in quasi‐random 4‐uniform hypergraphs ⋮ Regularity properties for triple systems
This page was built for publication: Counting Small Cliques in 3-uniform Hypergraphs
