login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A243251 Number of simple connected graphs g whose fractional chromatic number is not equal to its (integer) chromatic number. 2
0, 0, 0, 0, 1, 3, 33, 496, 16464, 969293 (list; graph; refs; listen; history; text; internal format)
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
Travis Hoppe and Anna Petrone, Encyclopedia of Finite Graphs
Eric Weisstein's World of Mathematics, Fractional Chromatic Number
FORMULA
a(n) = A001349(n) - A243252(n). - Andrew Howroyd, Nov 03 2017
CROSSREFS
Cf. A243252 (fractional chromatic number is equal to chromatic number)
Sequence in context: A264833 A071405 A234526 * A336539 A221147 A355795
KEYWORD
nonn,more
AUTHOR
Travis Hoppe and Anna Petrone, Jun 20 2014
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 10 14:52 EDT 2024. Contains 375056 sequences. (Running on oeis4.)