On the independence ratio of distance graphs

A distance graph is an undirected graph on the integers where two integers are adjacent if their difference is in a prescribed distance set. The independence ratio of a distance graph G is the maximum density of an independent set in G . Lih etźal. (1999) showed that the independence ratio is equal to the inverse of the fractional chromatic number, thus relating the concept to the well studied question of finding the chromatic number of distance graphs.We prove that the independence ratio of a distance graph is achieved by a periodic set, and we present a framework for discharging arguments to demonstrate upper bounds on the independence ratio. With these tools, we determine the exact independence ratio for several infinite families of distance sets of size three and determine asymptotic values for others.

[1]  Gerard J. Chang,et al.  Integral distance graphs , 1997 .

[2]  Olivier Togni,et al.  The packing coloring of distance graphs D(k, t) , 2014, Discret. Appl. Math..

[3]  Paul Erdös,et al.  Colouring prime distance graphs , 1990, Graphs Comb..

[4]  Stephen D. Cohen.  CLIQUE NUMBERS OF PALEY GRAPHS , 1988 .

[5]  Zsolt Tuza,et al.  Distance Graphs with Finite Chromatic Number , 2002, J. Comb. Theory, Ser. B.

[6]  Xuding Zhu,et al.  Distance graphs with missing multiples in the distance sets , 1999, J. Graph Theory.

[7]  Xuding Zhu,et al.  The chromatic numbers of distance graphs , 1997, Discret. Math..

[8]  Joseph G. Peters,et al.  Efficient domination in circulant graphs with two chord lengths , 2007, Inf. Process. Lett..

[9]  Mauro Leoncini,et al.  On the Lovász Number of Certain Circulant Graphs , 2000, CIAC.

[10]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[11]  Ben Green.  Counting Sets With Small Sumset, And The Clique Number Of Random Cayley Graphs , 2005, Comb..

[12]  Dennis Saleh.  Zs , 2001 .

[13]  Torsten Sander,et al.  Some Properties of Unitary Cayley Graphs , 2007, Electron. J. Comb..

[14]  E. Maistrelli,et al.  Some colouring problems for Paley graphs , 2006, Discret. Math..

[15]  R. D. Baker,et al.  Maximal cliques in the Paley graph of square order , 1996 .

[16]  Aart Blokhuis.  On subsets of GF(q2) with square differences , 1984 .

[17]  Bijan Taeri,et al.  On Cayley Sum Graphs of Non-Abelian Groups , 2016, Graphs Comb..

[18]  Xuding Zhu,et al.  Star Extremal Circulant Graphs , 1999, SIAM J. Discret. Math..

[19]  Paul Erdös,et al.  Colouring the real line , 1985, J. Comb. Theory B.

[20]  Richard Hoshino,et al.  INDEPENDENCE POLYNOMIALS OF CIRCULANT GRAPHS , 2007 .

[21]  Daphne Der-Fen Liu.  FROM RAINBOW TO THE LONELY RUNNER: A SURVEY ON COLORING PARAMETERS OF DISTANCE GRAPHS , 2008 .

[22]  Xuding Zhu,et al.  Star-extremal graphs and the lexicographic product , 1996, Discret. Math..

[23]  Xuding Zhu,et al.  Distance Graphs and T-Coloring , 1999, J. Comb. Theory B.

[24]  Peter Che Bor Lam,et al.  Coloring of distance graphs with intervals as distance sets , 2005, Eur. J. Comb..

[25]  Sampo Niskanen,et al.  Cliquer user's guide, version 1.0 , 2003 .

[26]  Xuding Zhu,et al.  Fractional chromatic number and circular chromatic number for distance graphs with large clique size , 2004, J. Graph Theory.

[27]  Clemens Heuberger,et al.  On planarity and colorability of circulant graphs , 2003, Discret. Math..

[28]  H. N. Ramaswamy,et al.  On the Energy of Unitary Cayley Graphs , 2009, Electron. J. Comb..

[29]  Jian Shen,et al.  Bounds for Ramsey numbers of complete graphs dropping an edge , 2008, Eur. J. Comb..

[30]  Arnfried Kemnitz,et al.  Coloring of integer distance graphs , 1998, Discret. Math..

[31]  Olivier Togni.  On packing colorings of distance graphs , 2014, Discret. Appl. Math..

[32]  Premysl Holub,et al.  Packing chromatic number of distance graphs , 2011, Discret. Appl. Math..

[33]  Karen L. Collins.  Circulants and Sequences , 1998, SIAM J. Discret. Math..

[34]  Stephen G. Hartke,et al.  Uniquely Kr-Saturated Graphs , 2012, Electron. J. Comb..

[35]  Y. Katznelson,et al.  Chromatic Numbers of Cayley Graphs on Z and Recurrence , 2001, Comb..

[36]  M. Behbahani.  On orthogonal matrices , 2004 .

[37]  Oriol Serra,et al.  Distance graphs with maximum chromatic number , 2008, Discret. Math..

[38]  Xuding Zhu,et al.  Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs , 1998, Eur. J. Comb..

[39]  Stephen G. Hartke,et al.  Uniquely Kr-Saturated Graphs , 2012, Electron. J. Comb..

[40]  Jason I. Brown,et al.  Proof of a conjecture on fractional Ramsey numbers , 2010, J. Graph Theory.

[41]  Daphne Der-Fen Liu,et al.  Chromatic number of distance graphs generated by the sets {2,3,x,y} , 2013, J. Comb. Optim..

[42]  Xuding Zhu.  Circular chromatic number of distance graphs with distance sets of cardinality 3 , 2002, J. Graph Theory.

[43]  Aleksandar Ilic,et al.  On the chromatic number of integral circulant graphs , 2010, Comput. Math. Appl..

[44]  J. N. Ridley,et al.  THE CLIQUE NUMBERS AND CHROMATIC NUMBERS OF CERTAIN PALEY GRAPHS , 1988 .

[45]  Sebastiano Vigna,et al.  Hardness Results and Spectral Techniques for Combinatorial Problems on Circulant Graphs , 1998 .

[46]  Primoz Potocnik,et al.  Distance-regular circulants , 2003, Eur. J. Comb..

[47]  Aleksandar Ilic,et al.  On the clique number of integral circulant graphs , 2009, Appl. Math. Lett..