A conjecture on the fractional ID-\([a,b]\)-factor-critical graphs
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.
Authors
- Hongzhang Chen (ORCID: https://orcid.org/0009-0007-6601-0673)
- Jianxi Li
- Zeyuan Wu
Publication Details
- Journal
- RAIRO - Operations Research
- Published
- 2026-11-16
- DOI
- https://doi.org/10.1051/ro/2026124
- Primary Topic
- Advanced Graph Theory Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00