English

Enclosings of Decompositions of Complete Multigraphs in 2-Factorizations

Combinatorics 2016-08-26 v1

Abstract

Let kk, λ\lambda and μ\mu be positive integers. A decomposition of a multigraph λG \lambda G into edge-disjoint subgraphs G1,,GkG_1, \ldots , G_k is said to be \emph{enclosed} by a decomposition of a multigraph μH\mu H into edge-disjoint subgraphs H1,,HkH_1, \ldots , H_k if μ>λ\mu > \lambda and GiG_i is a subgraph of HiH_i, 1ik1 \leq i \leq k. In this paper we initiate the study of when a decomposition can be enclosed by a decomposition that consists of spanning subgraphs. A decomposition of a graph is a 2-factorization if each subgraph is 2-regular and is Hamiltonian if each subgraph is a Hamiltonian cycle. Let nn and mm be positive integers. We give necessary and sufficient conditions for enclosing a decomposition of λKn\lambda K_n in a 22-factorization of μKn+m\mu K_{n+m} whenever μ>λ\mu>\lambda and mn2m \geq n-2. We also give necessary and sufficient conditions for enclosing a decomposition of λKn\lambda K_n in a Hamiltonian decomposition of μKn+m\mu K_{n+m} whenever μ>λ\mu > \lambda and mn1m \geq n-1, or μ>λ\mu > \lambda, n=3n=3 and m=1m=1, or μ=2\mu = 2, λ=1\lambda=1 and m=n2m=n-2.

Keywords

Cite

@article{arxiv.1608.06961,
  title  = {Enclosings of Decompositions of Complete Multigraphs in 2-Factorizations},
  author = {Carl Feghali and Matthew Johnson},
  journal= {arXiv preprint arXiv:1608.06961},
  year   = {2016}
}

Comments

19 pages