paper

A Tutte-type characterization for graph factors

arXiv:1512.05182

Abstract

Let be a connected general graph. Let be a function. We show that satisfies the Tutte-type condition \[ o(G-S)\le f(S)\qquad\text{for all vertex subsets }, \] if and only if it contains a colored -factor for any -end-coloring, where is the union of all odd integers smaller than and the integer itself. This is a generalization of the -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.

12 pages