Can a Graph Have Distinct Regular Partitions?

DOI10.1007/978-3-540-73545-8_42MaRDI QIDQ3608867zbMATH OpenOpenAlexFDO

Authors Noga Alon, Asaf Shapira, Uri Stav

Publication date 6 March 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73545-8_42

Mathematics Subject Classification ID

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

Recommendations

• Can a graph have distinct regular partitions?
• The Algorithmic Aspects of the Regularity Lemma
• Approximate hypergraph partitioning and applications
• On regularity lemmas and their algorithmic applications
• scientific article; zbMATH DE number 1256685

Cited in

(8)

• Regularity lemma for distal structures
• Regularity lemmas for clustering graphs
• Regular partitions of gentle graphs
• Regularity partitions and the topology of graphons
• Can a graph have distinct regular partitions?
• Regularity lemmas for stable graphs
• A note on permutation regularity
• Holes in graphs

This page was built for publication: Can a Graph Have Distinct Regular Partitions?

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