Charles Kenney

activity

20192024

most citedAsymptotics for Palette Sparsification

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

collaborators

5 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.CO2024★ 1 cited

Asymptotics for Palette Sparsification from Variable Lists

Jeff Kahn, Charles Kenney

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

math.NT2024

Creating Decidable Diophantine Equations

Robert Dougherty-Bliss, Charles Kenney, Doron Zeilberger

Generalizing an argument of Matiyasevich, we illustrate a method to generate infinitely many diophantine equations whose solutions can be completely described by linear recurrences…

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…

math.SP2019

A Cheeger inequality for graphs based on a reflection principle

Edward Gelernt, Diana Halikias, Charles Kenney +1

Given a graph with a designated set of boundary vertices, we define a new notion of a Neumann Laplace operator on a graph using a reflection principle. We show that the first eigen…