Answers are grounded in this paper and cite their sources.
For an integer \(r≥ 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.
No takes yet. Share an insight, caveat, or question.
Wu et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: