English

The Extension Degree Conditions for Fractional Factor

Combinatorics 2019-04-05 v1

Abstract

In Gao's previous work, the authors determined several graph degree conditions of a graph which admits fractional factor in particular settings. It was revealed that these degree conditions are tight if b=f(x)=g(x)=ab=f(x)=g(x)=a for all vertices xx in GG. In this paper, we continue to discuss these degree conditions for admitting fractional factor in the setting that several vertices and edges are removed and there is a difference Δ\Delta between g(x)g(x) and f(x)f(x) for every vertex xx in GG. These obtained new degree conditions reformulate Gao's previous conclusions, and show how Δ\Delta acts in the results. Furthermore, counterexamples are structured to reveal the sharpness of degree conditions in the setting f(x)=g(x)+Δf(x)=g(x)+\Delta.

Keywords

Cite

@article{arxiv.1904.02482,
  title  = {The Extension Degree Conditions for Fractional Factor},
  author = {Wei Gao and Weifan Wang and Juan L. G. Guirao},
  journal= {arXiv preprint arXiv:1904.02482},
  year   = {2019}
}
R2 v1 2026-06-23T08:29:10.215Z