Can a Graph Have Distinct Regular Partitions?

Abstract

The regularity lemma of Szemerédi gives a concise approximate description of a graph via a so called regular partition of its vertex set. In this paper we address the following problem: can a graph have two “distinct” regular partitions? It turns out that (as observed by several researchers) for the standard notion of a regular partition, one can construct… (More)
DOI: 10.1007/978-3-540-73545-8_42

Topics

  • Presentations referencing similar topics