1 research outputs found
Fractional chromatic number of a random subgraph
It is well known that a random subgraph of the complete graph has
chromatic number w.h.p. Boris Bukh asked whether the same
holds for a random subgraph of any -chromatic graph, at least in
expectation. In this paper it is shown that for every graph, whose fractional
chromatic number is at least , the fractional chromatic number of its random
subgraph is at least with probability more than
. This gives the affirmative answer for a strengthening of
Bukh's question for the fractional chromatic number.Comment: Short not