A Tutte-type characterization for graph factors
Hongliang Lu, David G.L. Wang

TL;DR
This paper generalizes Tutte-type conditions for graph factors, providing new characterizations involving colored factors and addressing open problems in graph theory related to odd factors and conditions.
Contribution
It introduces a Tutte-type characterization for the existence of colored $J_f^*$-factors in graphs, extending previous theorems and solving open problems.
Findings
Characterizes graphs satisfying $o(G-S) \\le f(S)$ with colored $J_f^*$-factors
Provides an analogous characterization for graphs of odd order
Addresses open problems by Cui, Kano, Akiyama
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Graph Theory Research · Graph Labeling and Dimension Problems
