Degree sum condition for fractional ID-$k$-factor-critical graphs
Wei Gao, Weifan Wang · Miskolc mathematical notes/Mathematical notes · 2017
A graph G is called a fractional ID-k-factor-critical graph if after deleting any independent set of G the resulting graph admits a fractional k-factor.In this paper, we prove that for k 2, G is a fractional ID-k-factor-critical graph if ı.G/ n 3 C k, 2 .G/ 4n 3 , n 6k 8.The result is best possible in some sense.