An Upper Bound on the Proportional Choice Number of a Graph

Proportional choosability is a list analogue of equitable coloring introduced in 2019 that imposes both upper and lower bounds on color class sizes based on the availability of each color. The proportional choice number of a graph $G$, denoted by $χ_{pc}(G)$, is the smallest positive integer $k$ such that $G$ is proportionally $k$-choosable. A recently proposed conjecture states that for any graph $G$ with at least one edge, $χ_{pc}(G) \leq Δ(G) + \text{col}(G) - 1$, where $Δ(G)$ is the maximum degree of $G$ and $\text{col}(G)$ is its coloring number. In this paper, we prove this conjecture using a generalization of Edmonds' matroid intersection theorem due to Aharoni and Berger, in which one of the matroids is replaced with an abstract simplicial complex. As a consequence, we can completely determine the proportional choice number of every path: $χ_{pc}(P_1)=1$, $χ_{pc}(P_n)=2$ for $2 \leq n \leq 5$, and $χ_{pc}(P_n)=3$ for $n \geq 6$. This resolves a question about paths that has remained open since the introduction of proportional choosability.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-18
DOI
https://doi.org/10.48550/arxiv.2611.24740
Primary Topic
Advanced Graph Theory Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

An Upper Bound on the Proportional Choice Number of a Graph

Jeffrey A. Mudrock, Kevin Grace
arXiv (Cornell University)
Advanced Graph Theory Research
preprint

An Upper Bound on the Proportional Choice Number of a Graph

Jeffrey A. Mudrock, Kevin Grace
preprint en

Abstract

Proportional choosability is a list analogue of equitable coloring introduced in 2019 that imposes both upper and lower bounds on color class sizes based on the availability of each color. The proportional choice number of a graph $G$, denoted by $χ_{pc}(G)$, is the smallest positive integer $k$ such that $G$ is proportionally $k$-choosable. A recently proposed conjecture states that for any graph $G$ with at least one edge, $χ_{pc}(G) \leq Δ(G) + \text{col}(G) - 1$, where $Δ(G)$ is the maximum degree of $G$ and $\text{col}(G)$ is its coloring number. In this paper, we prove this conjecture using a generalization of Edmonds' matroid intersection theorem due to Aharoni and Berger, in which one of the matroids is replaced with an abstract simplicial complex. As a consequence, we can completely determine the proportional choice number of every path: $χ_{pc}(P_1)=1$, $χ_{pc}(P_n)=2$ for $2 \leq n \leq 5$, and $χ_{pc}(P_n)=3$ for $n \geq 6$. This resolves a question about paths that has remained open since the introduction of proportional choosability.

arXiv (Cornell University)
Advanced Graph Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon