|
|
A243251
|
|
Number of simple connected graphs g whose fractional chromatic number is not equal to its (integer) chromatic number.
|
|
2
|
|
|
|
OFFSET
|
1,6
|
|
COMMENTS
|
This implies that there is a gap between the corresponding integer and linear programs defining fractional colorings. Every simple graph has a fractional chromatic number which is a rational number or integer.
|
|
LINKS
|
|
|
FORMULA
|
|
|
CROSSREFS
|
Cf. A243252 (fractional chromatic number is equal to chromatic number)
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|