3 papers
cs.DM2026
On the Extension Theorem for Packing Steiner Forests
Jinghan A Zeng
We consider the problem of packing edge-disjoint Steiner forests in a graph. The input consists of a multi-graph and a collection of vertex subsets $S = \{S_1,S_2,\ld…
math.CO2025
Paintability of -chromatic graphs
Peter Bradshaw, Jinghan A Zeng
The online list coloring game is a two-player graph-coloring game played on a graph as follows. On each turn, a Lister reveals a new color at some subset …
cs.GT2024
On the structure of EFX orientations on graphs
Jinghan A Zeng, Ruta Mehta
Fair division is the problem of allocating a set of items among agents in a fair manner. One of the most sought-after fairness notions is envy-freeness (EF), requiring that no agen…