Sharp Choice Number Thresholds for Complete Bipartite Graphs
Axioms · 27.03.2026 · 15 (4) · 252
DOI: 10.3390/axioms15040252 ↗Kurz gefasst
Fachartikel in der Zeitschrift Axioms, online erschienen am 27.03.2026. Verfasst von Julian Allagan und 4 weiteren Autor:innen. Die Arbeit nennt 17 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: US department of Education.
Abstract (Originalsprache)
Fix m≥3. The choice number ch(Km,n) of the complete bipartite graph Km,n has two sharp thresholds as n grows. We give complete proofs of the Hoffman–Johnson values at levels m+1 and m, and we pin down the extremal list assignments at the lower threshold n0=(m−1)m−1−(m−2)m−1. Specifically, ch(Km,n)=m+1,n≥mm,m,n0≤n
Förderung
- US department of Education
Zitieren
APA
Allagan, J., Bobga, B., Su, J., Gao, W., & Gao, S. (2026). Sharp Choice Number Thresholds for Complete Bipartite Graphs. Axioms, 15(4), 252. https://doi.org/10.3390/axioms15040252
Vancouver
Allagan J, Bobga B, Su J, Gao W, Gao S. Sharp Choice Number Thresholds for Complete Bipartite Graphs. Axioms. 2026;15(4):252. doi:10.3390/axioms15040252
BibTeX
@article{Allagan2026,
author = {Allagan, Julian and Bobga, Benkam and Su, Jianning and Gao, Weizheng and Gao, Shanzhen},
title = {Sharp Choice Number Thresholds for Complete Bipartite Graphs},
journal = {Axioms},
year = {2026},
volume = {15},
number = {4},
pages = {252},
doi = {10.3390/axioms15040252}
}
EUVIMED