Can a Graph Have Distinct Regular Partitions?
نویسندگان
چکیده
منابع مشابه
Can a Graph Have Distinct Regular Partitions?
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 a graph that has very distinct regular...
متن کاملDestroying Noncomplete Regular Components in Graph Partitions
We prove that if G is a graph and r1, . . . , rk ∈ Z≥0 such that ∑k i=1 ri ≥ ∆(G) + 2 − k then V (G) can be partitioned into sets V1, . . . , Vk such that ∆(G[Vi]) ≤ ri and G[Vi] contains no non-complete ri-regular components for each 1 ≤ i ≤ k. In particular, the vertex set of any graph G can be partitioned into ⌈ ∆(G)+2 3 ⌉ sets, each of which induces a disjoint union of triangles and paths.
متن کاملParity Results for p-Regular Partitions with Distinct Parts
We consider the partition function bp(n), which counts the number of partitions of the integer n into distinct parts with no part divisible by the prime p. We prove the following: Let p be a prime greater than 3 and let r be an integer between 1 and p−1, inclusively, such that 24r + 1 is a quadratic nonresidue modulo p. Then, for all nonnegative integers n, bp(pn + r) ≡ 0 (mod 2).
متن کاملClassifying ω-Regular Partitions
We try to develop a theory of ω-regular partitions in parallel with the theory around the Wagner hierarchy of regular ω-languages. In particular, we generalize a theorem of L. Staiger and K. Wagner to the case of partitions, prove decidability of all levels of the Boolean hierarchy of regular partitions over open sets, establish coincidence of reducibilities by continuous functions and by funct...
متن کاملRegular coding partitions
The canonical coding partition of a set of words is the finest partition such that the words contained in at least two factorizations of a same sequence belong to a same class. In the case the set is not uniquely decipherable, it partitions the set into one unambiguous class and other parts that localize the ambiguities in the factorizations of finite sequences. We prove that the canonical codi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2009
ISSN: 0895-4801,1095-7146
DOI: 10.1137/070695952