English

Factors and connected factors in tough graphs with high isolated toughness

Combinatorics 2022-05-10 v3

Abstract

Let GG be a graph and let ff be a positive integer-valued function on V(G)V(G). Assume that for all SV(G)S\subseteq V(G), vI(GS)f(v)(f(v)+1)S,\sum_{v\in I(G\setminus S)}f(v)(f(v)+1)\le |S|, where I(GS)I(G\setminus S) denotes the set of isolated vertices of GSG\setminus S. In this paper, we show that if for all SV(G)S\subseteq V(G), ω(GS)vS(f(v)1)+1,\omega(G\setminus S)\le \sum_{v\in S}(f(v)-1)+1, and vV(G)f(v)\sum_{v\in V(G)}f(v) is even, then GG has a factor FF such that for each vertex vv, dF(v)=f(v)d_F(v)=f(v), where ω(GS)\omega(G\setminus S) denotes the number of components of GSG\setminus S. Moreover, we show that if for all SV(G)S\subseteq V(G), ω(GS)14S+1,\omega(G\setminus S)\le \frac{1}{4}|S|+1, and f2f\ge 2, then GG has a connected factor HH such that for each vertex vv, dH(v){f(v),f(v)+1}d_H(v)\in \{f(v),f(v)+1\}.

Keywords

Cite

@article{arxiv.1812.11640,
  title  = {Factors and connected factors in tough graphs with high isolated toughness},
  author = {Morteza Hasanvand},
  journal= {arXiv preprint arXiv:1812.11640},
  year   = {2022}
}

Comments

The second part of the former version will be published in another paper