Equitable coloring of random graphs

نویسندگان

  • Michael Krivelevich
  • Balázs Patkós
چکیده

An equitable coloring of a graph is a proper vertex coloring such that the sizes of any two color classes differ by at most one. The least positive integer k for which there exists an equitable coloring of a graph G with k colors is said to be the equitable chromatic number of G and is denoted by χ=(G). The least positive integer k such that for any k′ ≥ k there exists an equitable coloring of a graph G with k′ colors is said to be the equitable chromatic threshold of G and is denoted by χ=(G). In this paper we investigate the asymptotic behavior of these coloring parameters in the probability space G(n, p) of random graphs. We prove that if n−1/5+ǫ < p < 0.99 for some 0 < ǫ, then almost surely χ(G(n, p)) ≤ χ=(G(n, p)) = (1 + o(1))χ(G(n, p)) holds (where χ(G(n, p)) is the ordinary chromatic number of G(n, p)). We also show that there exists a constant C such that if C/n < p < 0.99, then almost surely χ(G(n, p)) ≤ χ=(G(n, p)) ≤ (2 + o(1))χ(G(n, p)). Concerning the equitable chromatic threshold, we prove that if n−(1−ǫ) < p < 0.99 for some 0 < ǫ, then almost surely χ(G(n, p)) ≤ χ=(G(n, p)) ≤ (2 + o(1))χ(G(n, p)) holds, and if log 1+ǫ n n < p < 0.99 for some 0 < ǫ, then almost surely we have χ(G(n, p)) ≤ χ=(G(n, p)) = Oǫ(χ(G(n, p))).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Equitable Online-Colorings of Random Graphs

A proper graph coloring is called equitable if the sizes of every two color classes differ by at most one. We consider the following generalized notion of graph colorings: a vertex coloring of graph G is valid w.r.t. some fixed nonempty graph F if no color class induces a copy of F in G, i.e., there is no monochromatic copy of F in G. We propose and analyze an algorithm for computing valid equi...

متن کامل

Equitable Colorings of Cartesian Product Graphs of Wheels with Complete Bipartite Graphs

By the sorting method of vertices, the equitable chromatic number and the equitable chromatic threshold of the Cartesian products of wheels with bipartite graphs are obtained. Key–Words: Cartesian product, Equitable coloring, Equitable chromatic number, Equitable chromatic threshold

متن کامل

Equitable Coloring of Interval Graphs and Products of Graphs

We confirm the equitable ∆-coloring conjecture for interval graphs and establish the monotonicity of equitable colorability for them. We further obtain results on equitable colorability about square (or Cartesian) and cross (or direct) products of graphs.

متن کامل

Equitable coloring of corona products of cubic graphs is harder than ordinary coloring

A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the number of vertices in any two sets differ by at most one. The smallest k for which such a coloring exists is known as the equitable chromatic number of G and it is denoted by χ=(G). In this paper the problem of determinig χ= for coronas of cubic graphs is studied. Although the prob...

متن کامل

Equitable colorings of corona multiproducts of graphs

A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the number of vertices in any two sets differ by at most one. The smallest k for which such a coloring exists is known as the equitable chromatic number of G and denoted χ=(G). It is known that this problem is NP-hard in general case and remains so for corona graphs. In [12] Lin i Chan...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Random Struct. Algorithms

دوره 35  شماره 

صفحات  -

تاریخ انتشار 2009