Fractional chromatic number of distance graphs generated by two-interval sets

  • Authors:

  • Daphne Der-Fen Liu;Xuding Zhu

  • Affiliations:

  • Department of Mathematics, California State University, Los Angeles, Los Angeles, CA 90032, USA;Department of Applied Mathematics, National Sun Yat-sen University, Kaohsiung 80424, Taiwan and National Center for Theoretical Sciences, Taiwan

  • Venue:
  • European Journal of Combinatorics
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Let D be a set of positive integers. The distance graph generated by D, denoted by G(Z,D), has the set Z of all integers as the vertex set, and two vertices x and y are adjacent whenever |x-y|@?D. For integers 1