Premium
The fractional chromatic number of mycielski's graphs
Author(s) -
Larsen Michael,
Propp James,
Ullman Daniel
Publication year - 1995
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190190313
Subject(s) - combinatorics , mathematics , chromatic scale , clique number , clique , sequence (biology) , discrete mathematics , genetics , biology
James Propp The most familiar construction of graphs whose clique number is much smaller than their chromatic number is due to Mycielski, who constructed a sequence G n of triangle‐free graphs with X( G n ) = n . In this article, we calculate the fractional chromatic number of G n and show that this sequence of numbers satisfies the unexpected recurrence a n+1 = a n + (1/ a n ). © 1995 John Wiley & Sons, Inc.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom