Work

A conjecture on the fractional ID-\([a,b]\)-factor-critical graphs

Year: 2026
Type: article
Abstract: 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.
Language: English
Open Access status: diamond
OpenAlex ID: W7234340410
FWCI:
Cites:
Cited by:
Related to: 10