On random sampling in uniform hypergraphs

DOI10.1002/rsa.20326zbMath1225.05216OpenAlexW1993798946MaRDI QIDQ5198663

Brendan Nagle, Andrzej Czygrinow

Publication date: 9 August 2011

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

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

zbMATH Keywords

random samplinghypergraph regularity

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65)

Related Items (2)

Hypergraph regularity and random sampling ⋮ A geometric theory for hypergraph matching

Cites Work

• On graphs with small subgraphs of large chromatic number
• Hypergraphs, quasi-randomness, and conditions for regularity
• Uniform edge distribution in hypergraphs is hereditary
• Hypergraph regularity and the multidimensional Szemerédi theorem
• Random sampling and approximation of MAX-CSP problems
• The Algorithmic Aspects of the Regularity Lemma
• A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph
• Regular Partitions of Hypergraphs: Regularity Lemmas
• The counting lemma for regular k‐uniform hypergraphs

This page was built for publication: On random sampling in uniform hypergraphs