A note on $\mathtt{V}$-free $2$-matchings
Combinatorics
2015-05-15 v1 Discrete Mathematics
Abstract
Motivated by a conjecture of Liang [Y.-C. Liang. {\em Anti-magic labeling of graphs}. PhD thesis, National Sun Yat-sen University, 2013.], we introduce a restricted path packing problem in bipartite graphs that we call a -free -matching. We verify the conjecture through a weakening of the hypergraph matching problem. We close the paper by showing that it is NP-complete to decide whether one of the color classes of a bipartite graph can be covered by a -free -matching.
Keywords
Cite
@article{arxiv.1505.03717,
title = {A note on $\mathtt{V}$-free $2$-matchings},
author = {Kristóf Bérczi and Attila Bernáth and Máté Vizer},
journal= {arXiv preprint arXiv:1505.03717},
year = {2015}
}