Abstract
Let a and b be two positive integers with with \(1\le a\le b\) and \(b\ge 2\), and let G be a graph of order \(n\ge \frac{(a+b-3)(2a+b-1)-a+1}{a}\). We say that G has all fractional [a, b]-factors if G has a fractional r-factor for any integer r with \(a\le r\le b\). In this paper, we testify that \(G-I\) has all fractional [a, b]-factors for any independent set I of G if \(\delta (G)\ge \frac{(a+b-1)n+a+b-1}{2a+b-1}\) and \(\delta (G)>\frac{(a+b-2)n+2\alpha (G)-1}{2a+b-2}\). Furthermore, the result in Theorem 1 is sharp.
Similar content being viewed by others
References
W. Gao, L. Liang, T. Xu, J. Zhou, Degree conditions for fractional \((g,f,n^{\prime },m)\)-critical deleted graphs and fractional ID-\((g,f,m)\)-deleted graphs, Bull. Malays. Math. Sci. Soc. (2), 39(2016), 315–330.
W. Gao, W. Wang, New isolated toughness condition for fractional \((g,f,n)\)-critical graphs, Colloq. Math., 147(1)(2017), 55–66.
K. Kimura, \(f\)-factors, complete-factors, and component-deleted subgraphs, Discrete Math., 313(2013), 1452–1463.
M. Kouider, S. Ouatiki, Sufficient condition for the existence of an even \([a,b]\)-factor in graph, Graphs Combin., 29(2013), 1051–1057.
G. Liu, L. Zhang, Toughness and the existence of fractional \(k\)-factors of graphs, Discrete Math., 308(2008), 1741–1748.
H. Lu, Simplifed existence theorems on all fractional \([a,b]\)-factors, Discrete Appl. Math., 161(2013), 2075–2078.
X. Lv, A degree condition for fractional \((g,f,n)\)-critical covered graphs, AIMS Mathematics, 5(2)(2020), 872–878.
T. Niessen, Nash-Williams conditions and the existence of \(k\)-factors, Ars Combin., 34(1992), 251–256.
T. Nishimura, A degree condition for the existence of \(k\)-factors, J. Graph Theory, 16(1992), 141–151.
M. D. Plummer, Graph factors and factorization: 1985–2003: A survey, Discrete Math., 307(2007), 791–821.
S. Wang, W. Zhang, On \(k\)-orthogonal factorizations in networks, RAIRO Oper. Res., 55(2021), 969–977.
S. Wang, W. Zhang, Research on fractional critical covered graphs, Probl. Inf. Transm., 56(2020), 270–277.
S. Zhou, A neighborhood union condition for fractional \((a,b,k)\)-critical covered graphs, Discrete Appl. Math., https://doi.org/10.1016/j.dam.2021.05.022
S. Zhou, Binding numbers and restricted fractional \((g,f)\)-factors in graphs, Discrete Appl. Math., https://doi.org/10.1016/j.dam.2020.10.017
S. Zhou, Remarks on path factors in graphs, RAIRO Oper. Res., 54(2020), 1827–1834.
S. Zhou, Some new sufficient conditions for graphs to have fractional \(k\)-factors, Int. J. Comput. Math., 88(2011), 484–490.
S. Zhou, Q. Bian, Q. Pan, Path factors in subgraphs, Discrete Appl. Math., https://doi.org/10.1016/j.dam.2021.04.012
S. Zhou, H. Liu, Y. Xu, A note on fractional ID-\([a,b]\)-factor-critical covered graphs, Discrete Appl. Math., https://doi.org/10.1016/j.dam.2021.03.004
S. Zhou, Z. Sun, On all fractional \((a,b,k)\)-critical graphs, Acta Math. Sin. (Engl. Ser.), 30(2014), 696–702.
S. Zhou, Z. Sun, H. Liu, Isolated toughness and path-factor uniform graphs, RAIRO Oper. Res., 55(2021), 1279–1290.
S. Zhou, Z. Sun, Q. Pan, A sufficient condition for the existence of restricted fractional \((g,f)\)-factors in graphs, Probl. Inf. Transm., 56(2020), 332–344.
S. Zhou, Y. Xu, Z. Sun, Degree conditions for fractional \((a,b,k)\)-critical covered graphs, Inform. Process. Lett., 152(2019), 105838, https://doi.org/10.1016/j.ipl.2019.105838
S. Zhou, T. Zhang, Z. Xu, Subgraphs with orthogonal factorizations in graphs, Discrete Appl. Math., 286(2020), 29–34.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Sharad S Sane
Rights and permissions
About this article
Cite this article
Sun, Z., Zhou, S. Nash-Williams conditions for the existence of all fractional [a, b]-factors. Indian J Pure Appl Math 52, 542–547 (2021). https://doi.org/10.1007/s13226-021-00054-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13226-021-00054-3