English

Packing paths in a $(\lambda+\mu)K_{v+u}-\lambda K_v$

Combinatorics 2016-03-16 v2

Abstract

Following standard terminology, λKv\lambda K_v is a multigraph on vv vertices such that λ\lambda edges join each pair of vertices. Let (λ+μ)Kv+uλKv(\lambda+\mu)K_{v+u}-\lambda K_v be the graph (VU,E)(V\cup U,E) with V=v|V|=v, U=u|U|=u, and (λ+μ)λ=μ(\lambda+\mu)-\lambda=\mu edges between the vertices xx and yy if xx and yy both lie in VV and λ+μ\lambda+\mu edges between xx and yy otherwise. The main result of this paper establishes necessary and sufficient conditions for an mm-path decomposition of (λ+μ)Kv+uλKv(\lambda+\mu)K_{v+u}-\lambda K_v.

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

R2 v1 2026-06-22T11:36:59.168Z