When is ch(K(m,n))=m-1?

Details When is ch(K(m,n))=m-1? When is ch(K(m,n))=m-1?

2006-11-09

arxiv.org/abs/math/0611262v1

Mathematics

Combinatorics

24 pages

Scientific paper

Let n_m be the smallest integer n such that ch(K_{m,n}) = m-1, where ch(G)
denotes the choice (list chromatic) number of the graph G. We prove that there
is an infinite sequence of integers S, such that if m is in S, then n_m <=
0.4643 ((m-2)^(m-2)). If m -> infinity, then n_m is asymptotically at most
0.474 ((m-2)^(m-2)).

Affiliated with

Also associated with

No associations

Rating

When is ch(K(m,n))=m-1? does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with When is ch(K(m,n))=m-1?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and When is ch(K(m,n))=m-1? will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-407823