Colouring powers of cycles from random lists
| dc.creator | Krivelevich, Michael | |
| dc.creator | Nachmias, Asaf | |
| dc.date | 2005-12-01 | |
| dc.date.accessioned | 2026-07-07T06:54:43Z | |
| dc.date.available | 2026-07-07T06:54:43Z | |
| dc.description | Let $C_n^k$ be the $k$-th power of a cycle on $n$ vertices (i.e. the vertices of $C_n^k$ are those of the $n$-cycle, and two vertices are connected by an edge if their distance along the cycle is at most $k$). For each vertex draw uniformly at random a subset of size $c$ from a base set $S$ of size $s=s(n)$. In this paper we solve the problem of determining the asymptotic probability of the existence of a proper colouring from the lists for all fixed values of $c,k$, and growing $n$. | |
| dc.description | 7 pages | |
| dc.identifier | https://arxiv.org/abs/math/0512004 | |
| dc.identifier | http://arxiv.org/abs/math/0512004 | |
| dc.identifier | European J. of Combinatorics 25 (2004), 961-968 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/106039 | |
| dc.subject | Combinatorics | |
| dc.subject | Probability | |
| dc.title | Colouring powers of cycles from random lists | |
| dc.type | text |