Owen Henderschedt

activity

20242026

collaborators

10 papers

math.CO2026

Yes, $(2 K_{2}, K_{4})$ -free graphs are recolorable

Henry Echeverría, Owen Henderschedt

We prove that every $(2 K_{2}, K_{4})$ -free graph is recolorable. Equivalently, for every such graph $G$ and every $ℓ \geq χ (G) + 1$ , the reconfiguration graph of proper $ℓ$ -colorings…

math.CO2026

On the recolorability of $(2 K_{2}, K_{4})$ -free graphs

Henry Echeverría, Owen Henderschedt

Given a graph $G$ and an integer $ℓ > χ (G)$ , the reconfiguration graph of the $ℓ$ -colorings of $G$ has as its vertices as the proper $ℓ$ -colorings of $G$ , with an edge betwe…

math.CO2026

A finite victory over de Bruijn-Erdős in interval discrepancy

Jared DeLeo, Owen Henderschedt, Chris Wells

We study a finite form of the classical interval discrepancy problem. Starting from the unit interval, one repeatedly splits an existing interval into two until $n$ intervals have…

math.CO2025

Extending total colorings in planar graphs

Owen Henderschedt, Jessica McDonald

We initiate the study of total-coloring extensions, and focus our attention on planar graphs, asking: ``When can a total- $k$ -coloring of some subgraph $H$ of a planar graph $G$ be…

math.CO2025

Odd Ramsey numbers of multipartite graphs and hypergraphs

Nicholas Crawford, Emily Heath, Owen Henderschedt +2

Given a hypergraph $G$ and a subhypergraph $H$ of $G$ , the \emph{odd Ramsey number} $r_{o dd} (G, H)$ is the minimum number of colors needed to edge-color $G$ so that every copy of $H…

math.CO2025

Total coloring graphs with large minimum degree

Owen Henderschedt, Jessica McDonald, Songling Shan

We prove that for all $ε > 0$ , there exists a positive integer $n_{0}$ such that if $G$ is a graph on $n \geq n_{0}$ vertices with $δ (G) \geq \frac{1}{2} (1 + ε) n$ , then…

math.CO2025

Graphs generated from minimal sets of finite point-set topologies

Ketai Chen, Jared DeLeo, Owen Henderschedt

In 1985, Golumbic and Scheinerman established an equivalence between comparability graphs and containment graphs, graphs whose vertices represent sets, with edges indicating set co…

math.CO2024

Shrinking the Jung radius: Maximizing partial coverage of finite point sets

András Bezdek, Owen Henderschedt

Jung's theorem says that planar sets of diameter $1$ can be covered by a closed circular disk of radius $\frac{1}{3}$ . In this paper we consider a fractional Jung-type problem…

math.CO2024

On orientations with forbidden out-degrees

Owen Henderschedt, Jessica McDonald

Let $G$ be a $d$ -regular graph and let $F \subseteq {0, 1, 2, \dots, d}$ be a list of forbidden out-degrees. Akbari, Dalirrooyfard, Ehsani, Ozeki, and Sherkati conjectured that if…

math.CO2024

The forb-flex method for odd coloring and proper conflict-free coloring of planar graphs

James Anderson, Herman Chau, Eun-Kyung Cho +6

We introduce a new tool useful for greedy coloring, which we call the forb-flex method, and apply it to odd coloring and proper conflict-free coloring of planar graphs. The odd chr…

Yes, (2K2​,K4​)-free graphs are recolorable

On the recolorability of (2K2​,K4​)-free graphs

A finite victory over de Bruijn-Erdős in interval discrepancy

Extending total colorings in planar graphs

Odd Ramsey numbers of multipartite graphs and hypergraphs

Total coloring graphs with large minimum degree

Graphs generated from minimal sets of finite point-set topologies

Shrinking the Jung radius: Maximizing partial coverage of finite point sets

On orientations with forbidden out-degrees

The forb-flex method for odd coloring and proper conflict-free coloring of planar graphs

Yes, $(2 K_{2}, K_{4})$ -free graphs are recolorable

On the recolorability of $(2 K_{2}, K_{4})$ -free graphs