English

A Tutte-type characterization for graph factors

Combinatorics 2015-12-17 v1

Abstract

Let GG be a connected general graph. Let f ⁣:V(G)Z+f\colon V(G)\to \Z^+ be a function. We show that GG satisfies the Tutte-type condition o(GS)f(S)for all vertex subsets S, o(G-S)\le f(S)\qquad\text{for all vertex subsets $S$}, if and only if it contains a colored JfJ_f^*-factor for any 22-end-coloring, where Jf(v)J_f^*(v) is the union of all odd integers smaller than f(v)f(v) and the integer f(v)f(v) itself. This is a generalization of the (1,f)(1,f)-odd factor characterization theorem, and answers a problem of Cui and Kano. We also derive an analogous characterization for graphs of odd orders, which addresses a problem of Akiyama and Kano.

Keywords

Cite

@article{arxiv.1512.05182,
  title  = {A Tutte-type characterization for graph factors},
  author = {Hongliang Lu and David G. L. Wang},
  journal= {arXiv preprint arXiv:1512.05182},
  year   = {2015}
}

Comments

12 pages

R2 v1 2026-06-22T12:11:13.735Z