When is ch(K(m,n))=m-1?
| dc.creator | Gazit, Nurit | |
| dc.date | 2006-11-09 | |
| dc.date.accessioned | 2026-07-07T07:32:42Z | |
| dc.date.available | 2026-07-07T07:32:42Z | |
| dc.description | 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)). | |
| dc.description | 24 pages | |
| dc.identifier | https://arxiv.org/abs/math/0611262 | |
| dc.identifier | http://arxiv.org/abs/math/0611262 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/119201 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C15 | |
| dc.title | When is ch(K(m,n))=m-1? | |
| dc.type | text |