Can a Graph Have Distinct Regular Partitions?

DOI10.1137/070695952zbMath1194.05120OpenAlexW2005617464MaRDI QIDQ5189515

Noga Alon, Asaf Shapira, Uri Stav

Publication date: 17 March 2010

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.4766

zbMATH Keywords

algorithmsimilarityisomorphicregular partitionsregularity Lemma

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Extremal combinatorics (05D99)

Related Items (4)

Additive approximation of generalized Turán questions ⋮ Bounds for graph regularity and removal lemmas ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs

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