A conjecture on the fractional ID-\([a,b]\)-factor-critical graphs
RAIRO - Operations Research · 17.11.2026
DOI: 10.1051/ro/2026124 ↗Kurz gefasst
Fachartikel in der Zeitschrift RAIRO - Operations Research, online erschienen am 17.11.2026. Verfasst von Zeyuan Wu und 2 weiteren Autor:innen.
Abstract (Originalsprache)
For an integer \(r\ge 1\), a graph \(G\) is called fractional ID-\([a,b]\)-factor-critical if for every independent set \(I\) of \(G\) with \(|I|=r\), the graph \(G-I\) has a fractional \([a,b]\)-factor. In this paper, we consider a conjecture of Jia, Fan and Liu [Spectral radius, the matching number and fractional criticality of graphs, Linear Algebra Appl., 732(2026), 1-17] on the fractional ID-\([a,b]\)-factor-critical graphs. We show that the conjecture does not hold for small orders by constructing a family of counterexamples. Furthermore, we prove that the conjecture is true for graphs of large order.
Zitieren
APA
Wu, Z., Chen, H., & Li, J. (2026). A conjecture on the fractional ID-\([a,b]\)-factor-critical graphs. RAIRO - Operations Research. https://doi.org/10.1051/ro/2026124
Vancouver
Wu Z, Chen H, Li J. A conjecture on the fractional ID-\([a,b]\)-factor-critical graphs. RAIRO - Operations Research. 2026. doi:10.1051/ro/2026124
BibTeX
@article{Wu2026,
author = {Wu, Zeyuan and Chen, Hongzhang and Li, Jianxi},
title = {A conjecture on the fractional ID-\([a,b]\)-factor-critical graphs},
journal = {RAIRO - Operations Research},
year = {2026},
doi = {10.1051/ro/2026124}
}
EUVIMED