3 papers
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 intervals have…
math.CO2025
Graph shadows and edge-regular graphs
Jared DeLeo
The definition of edge-regularity in graphs is a relaxation of the definition of strong regularity, so strongly regular graphs are edge-regular and, not surprisingly, the family of…
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…