JD Nir

collaborators

4 papers

math.CO2026

Achievable Burning Densities of Growing Grids

Jordan Barrett, Karen Gunderson, JD Nir +1

Graph burning is a discrete-time process on graphs where vertices are sequentially activated and burning vertices cause their neighbours to burn over time. In this work, we focus o…

math.CO2025

Hoffman-London graphs: When paths minimize $H$ -colorings among trees

David Galvin, Phillip Marmorino, Emily McMillon +2

Given a graph $G$ and a target graph $H$ , an $H$ -coloring of $G$ is an adjacency-preserving vertex map from $G$ to $H$ . The number of $H$ -colorings of $G$ , $hom (G, H)$ , has been st…

math.CO2025

Long paths need not minimize $H$ -colorings among trees

David Galvin, Emily McMillon, JD Nir +1

Given a graph $G$ and a target graph $H$ , an $H$ -coloring of $G$ is an adjacency-preserving vertex map from $G$ to $H$ . By appropriate choice of $H$ , these colorings can express, f…

math.CO2021

The chromatic number of random lifts of complete graphs

JD Nir, Xavier Pérez Giménez

An $n$ -lift of a graph $G$ is a graph from which there is an $n$ -to- $1$ covering map onto $G$ . Amit, Linial, and Matou\v sek (2002) raised the question of whether the chromatic num…

Achievable Burning Densities of Growing Grids

Hoffman-London graphs: When paths minimize H-colorings among trees

Long paths need not minimize H-colorings among trees

The chromatic number of random lifts of complete graphs

Hoffman-London graphs: When paths minimize $H$ -colorings among trees

Long paths need not minimize $H$ -colorings among trees