Equivalent regular partitions of three-uniform hypergraphs

DOI10.1002/RSA.21229MaRDI QIDQ6641065zbMATH OpenFDO

Authors B. Nagle, Vojtěch Rödl, M. Schacht

Publication date 20 November 2024

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

Full work available at URL https://doi.org/10.1002/RSA.21229

zbMATH Keywords

hypergraphsquasirandomnessregularity method

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Hypergraph regularity and quasi-randomness
• Regularity Lemma for k-uniform hypergraphs
• Regular Partitions of Hypergraphs: Regularity Lemmas
• Regularity lemmas for hypergraphs and quasi-randomness
• The counting lemma for regular k‐uniform hypergraphs

Cites work

• Extremal problems on set systems
• scientific article; zbMATH DE number 3641497 (Why is no real title available?)
• Hypergraph regularity and quasi-randomness
• Hypergraph regularity and the multidimensional Szemerédi theorem
• On characterizing hypergraph regularity
• Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
• Regular Partitions of Hypergraphs: Counting Lemmas
• Regular Partitions of Hypergraphs: Regularity Lemmas
• Regularity Lemma for k-uniform hypergraphs
• Regularity properties for triple systems
• The counting lemma for regular k‐uniform hypergraphs

This page was built for publication: Equivalent regular partitions of three-uniform hypergraphs

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