Packing paths in a $(\lambda+\mu)K_{v+u}-\lambda K_v$
Combinatorics
2016-03-16 v2
Abstract
Following standard terminology, is a multigraph on vertices such that edges join each pair of vertices. Let be the graph with , , and edges between the vertices and if and both lie in and edges between and otherwise. The main result of this paper establishes necessary and sufficient conditions for an -path decomposition of .
Cite
@article{arxiv.1511.01140,
title = {Packing paths in a $(\lambda+\mu)K_{v+u}-\lambda K_v$},
author = {John Asplund and Joe Chaffee and James M. Hammer},
journal= {arXiv preprint arXiv:1511.01140},
year = {2016}
}
Comments
This paper has been withdrawn due to a crucial error in Theorem 28