DeepAI
Log In Sign Up

Tight Bounds on The Clique Chromatic Number

06/19/2020
by   Gwenaël Joret, et al.
0

The clique chromatic number of a graph is the minimum number of colours needed to colour its vertices so that no inclusion-wise maximal clique which is not an isolated vertex is monochromatic. We show that every graph of maximum degree Δ has clique chromatic number O(Δ/log Δ). We obtain as a corollary that every n-vertex graph has clique chromatic number O(√(n/log n)). Both these results are tight.

READ FULL TEXT VIEW PDF

page 1

page 2

page 3

page 4

08/06/2022

Expanded-clique graphs and the domination problem

Given a graph G and a function f : V(G) →ℕ such that f(v_i) ≥ d(v_i) for...
11/06/2019

On the density of critical graphs with no large cliques

A graph G is k-critical if χ(G) = k and every proper subgraph of G is (k...
03/07/2020

Clustering powers of sparse graphs

We prove that if G is a sparse graph — it belongs to a fixed class of bo...
09/20/2021

Clique-Based Separators for Geometric Intersection Graphs

Let F be a set of n objects in the plane and let G(F) be its intersectio...
09/26/2011

Dynamic Local Search for the Maximum Clique Problem

In this paper, we introduce DLS-MC, a new stochastic local search algori...
04/24/2020

Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds

We prove that the Hadwiger number of an n-vertex graph G (the maximum si...

1 Overview and History

A clique colouring of a graph is a colouring of its vertices so that no inclusion-wise maximal clique of size at least two is monochromatic. The clique chromatic number of , introduced in [BGGPS], is the minimum number of colours in a clique colouring of . We show that every graph of maximum degree has clique chromatic number . We obtain as a corollary that every -vertex graph has clique chromatic number . Both these results are tight. Indeed, if the graph is triangle free, then the clique chromatic number coincides with the usual chromatic number, and these two bounds are best possible for the chromatic number [K].

The first results on the clique chromatic number of which we are aware were obtained in 1991 and concerned comparability graphs of partial orders. A partial order consists of a ground set and a reflexive, transitive, antisymmetric relation . Two elements and of X are comparable if either or . The comparability graph of this partial order has vertex set , and two vertices are joined by an edge if they are comparable.

It is easy to see that comparability graphs have clique chromatic number at most two. In [DSSW], Duffus, Sands, Sauer, and Woodrow, showed that there are complements of comparability graphs whose clique chromatic number exceeds two, and asked if the clique chromatic number of perfect graphs, a superclass of both the comparability graphs and their complements was bounded by a constant. In [DKT], Duffus, Kierstead, and Trotter show that the complements of comparability graphs have clique chromatic number at most . The question about the clique chromatic number of perfect graphs was popularized by Jensen and Toft in their 1994 manuscript [JT] setting out the most interesting questions about colouring graphs. It was recently answered in the negative by Charbit, Penev, Thomassé, and Trotignon [CPTT].

There has been significant interest on the clique chromatic number of other special classes of graphs (see e.g. [BGGPS, MS]), and the random graph for various values of  [MMP]. As far as we are aware, the only results concerning arbitrary graphs are unpublished results of Kotlov which are mentioned in [BGGPS]. That paper sets out that Kotlov showed that the clique chromatic number of an -vertex graph is at most and notes that it is unknown whether the ratio of the clique chromatic number to goes to zero as goes to infinity. Our main result shows that in fact, it does.

2 Our Results

In what follows , the neighbourhood of in , is the set of vertices of joined to by an edge. Our main result is the following:

Theorem 1.

For every , there exists a such that, every graph with maximum degree has clique chromatic number at most .

From which we obtain:

Corollary 2.

The clique chromatic number of an -vertex graph is .

Proof of corollary.

We choose a maximal sequence of vertices of such that setting , and , we have: . Clearly . Now, has maximum degree at most . Hence by Theorem 1, it has a clique colouring with colours. We extend such a clique colouring of , which uses colours not including , to a clique colouring of by colouring, for , each with colour , and with colour .

Since the colours we use on are distinct from the colours we use on , and we construct a clique colouring in , any monochromatic maximal clique with at least two vertices is coloured for some . Now the vertices coloured 0 are a stable set, and the vertices coloured for are all adjacent to which is not coloured . So, we do indeed have a clique colouring of . ∎

Proof of main theorem.

In 2018, Molloy [M] proved

Theorem 3 ([M], Theorem 1).

For every , there exists a such that, every triangle-free graph with maximum degree has list chromatic number at most .

To obtain the statement of Theorem 1 from the statement of this theorem we simply need to remove triangle-free and change list to clique. To obtain the proof of Theorem 1 from Molloy’s proof we make only a few minor adjustments. There is one small subtle difference which we need to point out however.

The number of colours we can use is , and our vertices are each assigned the list of colours. (Since Molloy is dealing with list colouring the list of colours assigned to his vertices are preasssigned. He also neglects to round down in his definition but he is indeed using the same value of as we do throughout).

By a partial clique colouring, we mean a colouring of some of the vertices of using colours in such that no maximal clique of size at least two is monochromatic. We assign the uncoloured vertices a new colour , and thus our condition is actually that the vertices of any monochromatic maximal clique of size at least two are coloured . The main work in the proof is to show that there is a partial colouring with the following property:

(1)

The partial clique colouring can be extended by assigning a colour from to each uncoloured vertex such that none of these vertices is in a monochromatic edge.

If we are given a partial clique colouring and an extension of it as in (1), then the resulting colouring is a clique colouring of . So to show the theorem it suffices to prove (1).

In proving that a partial clique colouring satisfies (1), we will need to consider for each vertex , the set of colours available to be assigned to , and the set of uncoloured neighbours for . For a partial clique colouring , we define the following parameters for each vertex :

  • , the union of and ;

  • for every colour , the following set

We set and define the following two flaws (events) for a partial clique colouring:

  • ,

  • .

If a flaw is or then we say is the vertex of and define to be . The proof of Lemma 5 of [M] shows that if a partial colouring has no flaws then it satisfies property (1). Specifically, it shows that if every uncoloured vertex is assigned a uniformly random colour from

then with positive probability we obtain an extension in which none of these vertices is in a monochromatic edge. The proof is a standard application of the local lemma. Thus we have the following lemma.

Lemma 4 (corresponds to Lemma 5 in [M], proof is verbatim the same).

Suppose we have a partial clique colouring with no flaws, i.e., such that neither nor holds for any vertex . Then we can extend by colouring each blank vertex with a colour in to obtain a clique colouring of .

In light of this lemma, we need only show that there is a partial colouring with no flaws. To do so, we adopt Molloy’s procedure which starts with the colouring in which every vertex is assigned , and then in each iteration uncolours and then randomly recolours the vertices in the neighbourhood of for some carefully chosen flaw until no such flaws exist. The latter is done using a recursive algorithm called in [M]. In this algorithm, when recolouring each vertex is assigned a colour from uniformly at random. For our purposes we need to make a subtle change in the recolouring procedure. Define

  • as the set of colours in not appearing in , along with .

(That is, when computing we ignore the neighbours of that are in .) In our version of the algorithm , when recolouring each vertex is assigned a colour from uniformly at random, instead of . The modified algorithm is described in Algorithm 1.

1:
2:for each  do
3:      a colour from chosen uniformly at random
4:while there are any flaws with or with  do
5:      least such flaw
6:     
7:return
Algorithm 1

Let us remark that if the graph is triangle free, then always holds; thus, in the triangle-free case the two versions of the algorithm are the same.

Note that, by the definition of , if the recolouring creates a monochromatic clique of size at least two which is not coloured , then all of the vertices of the clique are in . But then is not maximal as we can add to it. So recolouring leaves us with a partial clique colouring, as desired.

Note also that if a call to terminates, then we made some progress towards correcting the flaws.

Observation 5 (corresponds to Observation 6 in [M], proof is verbatim the same).

In the partial clique colouring returned by :

  • the flaw does not hold, and

  • there are no flaws that did not hold in .

Thanks to the above observation, to obtain a partial clique colouring without any flaw it suffices to start with the all blank colouring and then call at most once for each of the at most flaws of that colouring, where . Thus, to complete the proof of our theorem, it suffices to show that with positive probability, these at most calls to all terminate. Molloy shows precisely this in the triangle-free case, the proof consists of Lemmas 7, 8, and 9 in [M]. As it turns out, replacing the lists with the lists in the algorithm is the only modification that needs to be done in Molloy’s approach to prove our theorem. These three lemmas and their proofs can then be taken verbatim from [M] up to straightforward changes reflecting the modified lists used in the recolouring step. For completeness, we now consider each lemma in turn and summarize the changes that need to be done in their proofs.

We begin with the key lemma, bounding the probability that there is a flaw at after recolouring . The setup for this lemma is as follows. Each vertex has some some current list containing and perhaps other colours. We give each vertex a colour chosen randomly from , where the choices are made uniformly and independently. This determines and .

Lemma 6 (Lemma 7 in [M]).

  1. .

  2. .

The proof of this lemma is obtained by taking that of Lemma 7 in [M] and replacing every occurrence of the list (with a neighbour of ) with the list , to match our modified recolouring procedure. There are 12 such occurrences in part (a) of the proof, and 6 in part (b). There is also another small change to make in part (b) of the proof, namely, when considering colors , the line

should become

The reason the equality sign becomes an inequality is the following: For a vertex with , the probability that gets coloured in our recolouring is exactly . However, not all these vertices will contribute to , only those such that the colour is in after recolouring111Note that, while is unaffected by our recolouring, on the other hand is, which is why we need to distinguish between before and after recolouring., hence the inequality.

Next we turn to Lemmas 8 and 9 from [M]. These lemmas are used to perform a Moser-Tardós type analysis of the algorithm . First we introduce some notations, adapted from [M]. Suppose that we are given a collection of lists of available colours for the neighbours of a vertex . Let () be the set of all colour assignments from these lists such that the flaw (respectively ) holds. Then by Lemma 6 we have , which is a key fact used in the proof of the last lemma below.

The setup for Lemma 8 from [M] is as follows. Let and consider any of the at most ‘root’ calls to we make to fix our initial partial clique colouring, say we call it with flaw and partial clique colouring . (Thus, for the very first call is the all blank colouring.) Considering the subsequent recursive calls made by the algorithm, we let denote the partial clique colouring just after the -th recolouring step (the for loop in lines 2 and 3 of algorithm ). We let describe the random choices that have been made during the -th recolouring step, and finally we let be a “log” listing in a concise manner the recursive calls that were made during this particular call of in the while loop (lines 4–6 of the algorithm), see [M] for the precise definition of the log.

Lemma 7 (Lemma 8 in [M]).

Given we can reconstruct the first steps of .

Thus, knowing is enough to deduce all the random choices that were made up to step , that is, . The proof of this lemma is obtained from that of Lemma 8 in [M] by replacing every occurrence of the list (with a neighbour of ) with the list . Also, one observation needs to be slightly adapted: In 10th and 11th line in the proof of Lemma 8 in [M], Molloy remarks crucially that in his case the set does not change after recolouring because the graph is triangle free. In our setting, where the graph is arbitrary and , this remains true by the very definition of .

Finally, using the previous two lemmas, Lemma 9 from [M] shows that any call terminates with positive probability:

Lemma 8 (Lemma 9 in [M]).

For any partial clique colouring and any flaw of , the probability that performs at least recolouring steps is at most , where .

The proof is verbatim the same as that of Lemma 9 in [M], with the list replaced with in the definition of .

Given this lemma, the proof of our theorem follows: Starting with our initial all blank partial clique colouring, with probability at least we perform at most separate ‘root’ calls and eventually obtain a partial clique colouring without any flaws. Lemma 4 then implies that this partial clique colouring can be turned into a clique colouring.

In summary, by slightly modifying the recolouring procedure in the algorithm as we explained, and performing the straightforward changes described above, Molloy’s proof becomes a proof of our Theorem. ∎

3 A Connection to Perfect Graphs and An Intriguing Conjecture

We can associate to any graph , the clique hypergraph whose vertices are and whose edge sets are the maximal cliques of of size at least two. Then a normal colouring of is a colouring so that no edge of contains two vertices of the same colour, while a clique colouring of is one in which no edge of is monochromatic.

It seems possible that graphs that can be properly coloured with few colours would also permit colourings with relatively few colours such that no edge of is monochromatic. Of course, a colouring of the first type requires colours, where is the size of the largest clique in . So, an obvious conjecture in this direction is that if can be coloured using colours then has bounded clique chromatic number.

However insisting that has chromatic number does not tell us anything about the structure of . Indeed, for any graph , the disjoint union of and a clique with vertices yields such a graph . In particular there are such graphs with arbitrarily high clique chromatic number. A graph is perfect [B] if for every induced subgraph of , the chromatic number of is . A second obvious, but again false, conjecture, discussed above, is that perfect graphs have bounded clique colouring number.

Perfection is however related to two colourings of the hypergraph of the maximum cliques of a graph. Following Hoang and McDiarmid [HM], we say that a graph is -divisible if it can be -coloured so that no maximum clique of size at least two is monochromatic. Now, if has an proper colouring then giving one of the stable sets of the colouring colour one, and the others colour 2 shows that is -divisible. Thus every induced subgraph of a perfect graph is -divisible.

Now an odd cycle of size at least five is not

-divisible, because it is not bipartite. Thus if every induced subgraph of is -divisible then contains no induced odd cycle of length at least five. Hoang and McDiarmid [HM] conjectured that this necessary condition is also sufficient. Combined with the Perfect Graph Theorem this would yield: “Every induced subgraph of a graph is colourable if and only if every induced subgraph of both and its complement is -divisible.”

Acknowledgement

This research was carried out at the Eighth Bellairs Workshop on Geometry and Graphs. The authors would like to thank the organizers for the invitation to participate in the workshop, and McGill University for facilitating their work by making the venue available for the workshop. Montreal, Ottawa, Brussels, and Krakow are all very cold in January. The authors would also like to thank Micheal S.O’B. Molloy for most of the proof.

References

  • [BGGPS] G. Basco, S. Gravier, A. Gyárfás, M. Preissmann, A. Sebő: Colouring The Maximal Cliques of A Graph. SIAM J. Discrete Mathematics 17(3) (2004), 361-376.
  • [B] C. Berge: Perfect Graphs. Six Papers on Graph Theory (Indian Statistical Institute Calcutta, 1993), 1-21.
  • [CPTT] P. Charbit, I. Penev, S. Thomassé, N. Trotignon: Perfect Graphs of Arbitrarily Large Clique Chromatic Number. J. Combinatorial Theory Ser. B 116 (2016), 456-464.
  • [DSSW] D. Duffus, B.Sauer, N. Sands, R. E. Woodrow: Two Colouring All Two Element Maximal Antichains. J. Combinatorial Theory Ser. A 57(1) (1991), 109-116.
  • [DKT] D. Duffus, H. Kirstead, W.T. Trotter: Fibres and Ordered Set Colouring. J. Combinatorial Theory Ser. A 58(1) (1991), 158-164.
  • [HM] C. Hoang, C. McDiarmid: On The Divisibility of Graphs. Discrete Mathematics 242 (2002), 145-156.
  • [JT] T. Jensen, B. Toft: Graph Colouring Problems. John Wiley and Sons, (1994).
  • [K] J.-H. Kim: The Ramsey Number has order of magnitude . Random Structures and Algorithms 7 (1995), 173-207.
  • [MMP] C. McDiarmid, D. Mietsche, P. Prałat: Clique Colouring of Binomial Random graphs. Random Structures and Algorithms 54(4) (2019), 589-614.
  • [MS] B. Mohar, R. Skrekovski: The Grotzsch Theorem for The Hypergraph of Maximal Cliques. Electronic J. of Combinatorics 6 (1994), 13 pp.
  • [M] M. Molloy: The List Chromatic Number of Graphs with Small Clique Number. J. Combinatorial Theory Ser. B 134 (2019), 234-264.