11,094 research outputs found
Antifactors of regular bipartite graphs
Let be a bipartite graph, where and are color classes and
is the set of edges of . Lov\'asz and Plummer \cite{LoPl86} asked
whether one can decide in polynomial time that a given bipartite graph admits a 1-anti-factor, that is subset of such that for
all and for all . Cornu\'ejols \cite{CHP}
answered this question in the affirmative. Yu and Liu \cite{YL09} asked
whether, for a given integer , every -regular bipartite graph
contains a 1-anti-factor. This paper answers this question in the affirmative
- β¦