The Kneser graph K(n, k) is the graph whose vertices are the k-element subsets of an n elements set, with two vertices adjacent if they are disjoint. The square $$G^2$$G2 of a graph G is the graph defined on V(G) such that two vertices u and v are adjacent in $$G^2$$G2 if the distance between u and v in G is at most 2. Determining the chromatic number of the square of the Kneser graph K(n, k) is an interesting graph coloring problem, and is also related with intersecting family problem. The square of K(2k, k) is a perfect matching and the square of K(n, k) is the complete graph when $$n \ge 3k-1$$n≥3k-1. Hence coloring of the square of $$K(2k +1, k)$$K(2k+1,k) has been studied as the first nontrivial case. In this paper, we focus on the question of determining $$\chi (K^2(2k+r,k))$$χ(K2(2k+r,k)) for $$r \ge 2$$r≥2. Recently, Kim and Park (Discrete Math 315:69–74, 2014) showed that $$\chi (K^2(2k+1,k)) \le 2k+2$$χ(K2(2k+1,k))≤2k+2 if $$ 2k +1 = 2^t -1$$2k+1=2t-1 for some positive integer t. In this paper, we generalize the result by showing that for any integer r with $$1 \le r \le k -2$$1≤r≤k-2,(a)$$\chi (K^2 (2k+r, k)) \le (2k+r)^r$$χ(K2(2k+r,k))≤(2k+r)r, if $$2k + r = 2^t$$2k+r=2t for some integer t, and(b)$$\chi (K^2 (2k+r, k)) \le (2k+r+1)^r$$χ(K2(2k+r,k))≤(2k+r+1)r, if $$2k + r = 2^t-1$$2k+r=2t-1 for some integer t. On the other hand, it was shown in Kim and Park (Discrete Math 315:69–74, 2014) that $$\chi (K^2 (2k+r, k)) \le (r+2)(3k + \frac{3r+3}{2})^r$$χ(K2(2k+r,k))≤(r+2)(3k+3r+32)r for $$2 \le r \le k-2$$2≤r≤k-2. We improve these bounds by showing that for any integer r with $$2 \le r \le k -2$$2≤r≤k-2, we have $$\chi (K^2 (2k+r, k)) \le 2 \left( \frac{9}{4}k + \frac{9(r+3)}{8} \right) ^r$$χ(K2(2k+r,k))≤294k+9(r+3)8r. Our approach is also related with injective coloring and coloring of Johnson graph.
[1]
Ján Minác,et al.
Newton's Identities Once Again!
,
2003,
Am. Math. Mon..
[2]
Ko-Wei Lih,et al.
Coloring the square of the Kneser graph KG(2k+ 1, k) and the Schrijver graph SG(2k+ 2, k)
,
2008
.
[3]
Ko-Wei Lih,et al.
Coloring the square of the Kneser graph I and the Schrijver graph I
,
2009,
Discret. Appl. Math..
[4]
Germ'an Paz.
On the Interval [n,2n]: Primes, Composites and Perfect Powers
,
2013
.
[5]
Seog-Jin Kim,et al.
Injective chromatic number and chromatic number of the square of graphs
,
2009
.
[6]
Seog-Jin Kim,et al.
On the Chromatic Number of the Square of the Kneser Graph K(2k+1, k)
,
2004,
Graphs Comb..
[7]
Oleg V. Borodin,et al.
Colorings of plane graphs: A survey
,
2013,
Discret. Math..
[8]
Paul Erdös,et al.
INTERSECTION PROPERTIES OF SYSTEMS OF FINITE SETS
,
1978
.
[9]
László Lovász,et al.
Kneser's Conjecture, Chromatic Number, and Homotopy
,
1978,
J. Comb. Theory A.
[10]
Seog-Jin Kim,et al.
Improved bounds on the chromatic numbers of the square of Kneser graphs
,
2014,
Discret. Math..
[11]
Pierre Dusart.
Autour de la fonction qui compte le nombre de nombres premiers
,
1998
.