The fractional chromatic number binding functions of (cap, even hole)-free graphs
College Mathematics · 2026-11-21 · 1 (1) · 13-20
DOI: 10.68615/cm.0002 ↗At a glance
Journal article in College Mathematics, published online on 2026-11-21. Written by Chenglong Deng and 1 co-authors. 18 references. The full text is freely available (open access, CC BY 4.0).
Abstract (original language)
A hole is an induced cycle of length at least four, and a cap is a hole together with a vertex adjacent to exactly two consecutive vertices of the hole. We prove that if q ≥ 2 and G is a (cap, even hole)-free graph with no odd hole of length at most 2q − 1, then χ f (G) ≤ ((2q + 1)/(2q)) ω(G). The bound is best possible, as shown by clique blowups of C 2q+1 .
Cite
APA
Deng, C., & Zhu, X. (2026). The fractional chromatic number binding functions of (cap, even hole)-free graphs. College Mathematics, 1(1), 13-20. https://doi.org/10.68615/cm.0002
Vancouver
Deng C, Zhu X. The fractional chromatic number binding functions of (cap, even hole)-free graphs. College Mathematics. 2026;1(1):13-20. doi:10.68615/cm.0002
BibTeX
@article{Deng2026,
author = {Deng, Chenglong and Zhu, Xuding},
title = {The fractional chromatic number binding functions of (cap, even hole)-free graphs},
journal = {College Mathematics},
year = {2026},
volume = {1},
number = {1},
pages = {13--20},
doi = {10.68615/cm.0002}
}
EUVIMED