11,896 research outputs found
On-line list colouring of random graphs
In this paper, the on-line list colouring of binomial random graphs G(n,p) is
studied. We show that the on-line choice number of G(n,p) is asymptotically
almost surely asymptotic to the chromatic number of G(n,p), provided that the
average degree d=p(n-1) tends to infinity faster than (log log n)^1/3(log
n)^2n^(2/3). For sparser graphs, we are slightly less successful; we show that
if d>(log n)^(2+epsilon) for some epsilon>0, then the on-line choice number is
larger than the chromatic number by at most a multiplicative factor of C, where
C in [2,4], depending on the range of d. Also, for d=O(1), the on-line choice
number is by at most a multiplicative constant factor larger than the chromatic
number
Towards on-line Ohba's conjecture
The on-line choice number of a graph is a variation of the choice number
defined through a two person game. It is at least as large as the choice number
for all graphs and is strictly larger for some graphs. In particular, there are
graphs with whose on-line choice numbers are larger
than their chromatic numbers, in contrast to a recently confirmed conjecture of
Ohba that every graph with has its choice number
equal its chromatic number. Nevertheless, an on-line version of Ohba conjecture
was proposed in [P. Huang, T. Wong and X. Zhu, Application of polynomial method
to on-line colouring of graphs, European J. Combin., 2011]: Every graph
with has its on-line choice number equal its chromatic
number. This paper confirms the on-line version of Ohba conjecture for graphs
with independence number at most 3. We also study list colouring of
complete multipartite graphs with all parts of size 3. We prove
that the on-line choice number of is at most , and
present an alternate proof of Kierstead's result that its choice number is
. For general graphs , we prove that if then its on-line choice number equals chromatic number.Comment: new abstract and introductio
A Proof of a Conjecture of Ohba
We prove a conjecture of Ohba which says that every graph on at most
vertices satisfies .Comment: 21 page
- …