Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Colouring graphs from random lists (2402.09998v2)

Published 15 Feb 2024 in math.CO

Abstract: Given positive integers $k \leq m$ and a graph $G$, a family of lists $L = {L(v) : v \in V(G)}$ is said to be a random $(k,m)$-list-assignment if for every $v \in V(G)$ the list $L(v)$ is a subset of ${1, \ldots, m}$ of size $k$, chosen uniformly at random and independently of the choices of all other vertices. An $n$-vertex graph $G$ is said to be a.a.s. $(k,m)$-colourable if $\lim_{n \to \infty} \mathbb{P}(G \textrm{ is } L-colourable) = 1$, where $L$ is a random $(k,m)$-list-assignment. We prove that if $m \gg n{1/k2} \Delta{1/k}$ and $m \geq 3 k2 \Delta$, where $\Delta$ is the maximum degree of $G$ and $k \geq 3$ is an integer, then $G$ is a.a.s. $(k,m)$-colourable. This is not far from being best possible, forms a continuation of the so-called palette sparsification results, and proves in a strong sense a conjecture of Casselgren. Additionally, we consider this problem under the additional assumption that $G$ is $H$-free for some graph $H$. For various graphs $H$, we estimate the smallest $m$ for which an $H$-free $n$-vertex graph $G$ is a.a.s. $(k,m)$-colourable. This extends and improves several results of Casselgren.

Summary

We haven't generated a summary for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com