A minimum degree condition of fractional (k, m)-deleted graphs

作者：Zhou Sizhong^*

来源：Comptes Rendus Mathematique, 2009, 347(21-22): 1223-1226.

DOI：10.1016/j.crma.2009.09.022

Let G be a graph of order n, and let k >= 1 and m >= 1 be two integers. In this paper, we consider the relationship between the minimum degree delta(G) and the fractional (k, m)-deleted graphs. It is proved that if n >= 4k - 5 + 2(2k + 1)m and delta(G) >= n/2, then G is a fractional (k, m)-deleted graph. Furthermore, we show that the minimum degree condition is sharp in some sense. To cite this article: S. Zhou, C R. Acad. Sci. Paris, Ser. I 347 (2009).

• 出版日期2009-11
• 单位江苏科技大学