- Current Issue - Ahead of Print Articles - All Issues - Search - Open Access - Information for Authors - Downloads - Guideline - Regulations ㆍPaper Submission ㆍPaper Reviewing ㆍPublication and Distribution - Code of Ethics - For Authors ㆍOnlilne Submission ㆍMy Manuscript - For Reviewers - For Editors
 Degree conditions and fractional $k$-factors of graphs Bull. Korean Math. Soc. 2011 Vol. 48, No. 2, 353-363 https://doi.org/10.4134/BKMS.2011.48.2.353Printed March 1, 2011 Sizhong Zhou Jiangsu University of Science and Technology Abstract : Let $k\geq1$ be an integer, and let $G$ be a 2-connected graph of order $n$ with $n\geq\max\{7,4k+1\}$, and the minimum degree $\delta(G)\geq k+1$. In this paper, it is proved that $G$ has a fractional $k$-factor excluding any given edge if $G$ satisfies $\max\{d_G(x),d_G(y)\}\geq\frac{n}{2}$ for each pair of nonadjacent vertices $x,y$ of $G$. Furthermore, it is showed that the result in this paper is best possible in some sense. Keywords : graph, degree, $k$-factor, fractional $k$-factor MSC numbers : 05C70 Downloads: Full-text PDF