Equivalent regular partitions of three-uniform hypergraphs

DOI10.1002/RSA.21229MaRDI QIDQ6641065

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

Publication date: 20 November 2024

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

zbMATH Keywords

hypergraphsregularity methodquasirandomness

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Hypergraph regularity and the multidimensional Szemerédi theorem
• Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
• Regularity properties for triple systems
• Extremal problems on set systems
• On characterizing hypergraph regularity
• Regularity Lemma for k-uniform hypergraphs
• Regular Partitions of Hypergraphs: Regularity Lemmas
• Regular Partitions of Hypergraphs: Counting Lemmas
• 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)