The fractional chromatic number binding functions of (cap, even hole)-free graphs
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 .
Authors
- Xuding Zhu (ORCID: https://orcid.org/0000-0002-5502-5390)
- Chenglong Deng
Institutions
- Zhejiang Normal University (CN)
Publication Details
- Journal
- College Mathematics
- Published
- 2026-11-21
- DOI
- https://doi.org/10.68615/cm.0002
- Primary Topic
- Advanced Graph Theory Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00