Charles Kenney

most citedAsymptotics for Palette Sparsification

2 citations · 2 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2024

Palette Sparsification via FKNP

Vikrant Ashvinkumar, Charles Kenney

A random set $S$ is $p$ -spread if, for all sets $T$ , $P (S \supseteq T) \leq p^{∣ T ∣} .$ There is a constant $C > 1$ large enough that for every graph $G$ with maximum degree…

math.CO2023★ 2 cited

Asymptotics for Palette Sparsification

Jeff Kahn, Charles Kenney

It is shown that the following holds for each $ε > 0$ . For $G$ an $n$ -vertex graph of maximum degree $D$ and "lists" $L_{v}$ ( $v \in V (G)$ ) chosen independently and uniformly…