Partitioning the vertices of a torus into isomorphic subgraphs
Combinatorics
2020-06-16 v3
Abstract
Let be an induced subgraph of the torus . We show that when is even and divides some power of , then for sufficiently large the torus has a perfect vertex-packing with induced copies of . On the other hand, disproving a conjecture of Gruslys, we show that when is odd and not a prime power, then there exists such that divides some power of , but there is no such that has a perfect vertex-packing with copies of . We also disprove a conjecture of Gruslys, Leader and Tan by exhibiting a subgraph of the -dimensional hypercube , such that there is no for which has a perfect edge-packing with copies of .
Cite
@article{arxiv.1710.07255,
title = {Partitioning the vertices of a torus into isomorphic subgraphs},
author = {Marthe Bonamy and Natasha Morrison and Alex Scott},
journal= {arXiv preprint arXiv:1710.07255},
year = {2020}
}
Comments
17 pages, 3 figures