Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

APPML
2011

favoriteEmaildiscussreport

325views Software Engineering» more APPML 2011»

The fractional chromatic number of Zykov products of graphs

12 years 11 months ago

$The fractional chromatic number of Zykov products of graphs$

Download iti.mff.cuni.cz

Zykov designed one of the oldest known family of triangle-free graphs with arbitrarily high chromatic number. We determine the fractional chromatic number of the Zykov product of a family of graphs. As a corollary, we deduce that the fractional chromatic numbers of the Zykov graphs satisfy the same recurrence relation as those of the Mycielski graphs, that is an+1 = an + 1 an . This solves a conjecture of Jacobs.

Pierre Charbit, Jean-Sébastien Sereni

Real-time Traffic

APPML 2011 | Chromatic Numbers | Fractional Chromatic Numbers | Oldest Known Family | Software Engineering |

claim paper

Related Content

» On the fractional chromatic number and the lexicographic product of graphs

» Total and fractional total colourings of circulant graphs

» Copositive programming motivated bounds on the stability and the chromatic numbers

» Circular Chromatic Number of Hypergraphs

» The Last Fraction of a Fractional Conjecture

» Upper oriented chromatic number of undirected graphs and oriented colorings of product gra...

» On the packing chromatic number of Cartesian products hexagonal lattice and trees

» Proof of a conjecture on fractional Ramsey numbers

» Distinguishing Chromatic Number of Cartesian Products of Graphs

Post Info
More Details (n/a)

Added	12 May 2011
Updated	12 May 2011
Type	Journal
Year	2011
Where	APPML
Authors	Pierre Charbit, Jean-Sébastien Sereni

Comments (0)