The odd-prime-power torus packing conjecture

From papers

Let kk be an odd prime power and let m1m\ge1. Let HH be an induced subgraph of the Cartesian power CkmC_k^m of the cycle CkC_k, with V(H)|V(H)| dividing kmk^m. A perfect induced HH-packing is a collection of vertex-disjoint induced copies of HH covering every vertex of CknC_k^n.

Odd-prime-power torus packing conjecture. There exists n0n_0 such that, for all nn0n \ge n_0, CknC_k^n admits a perfect induced HH-packing.

The paper proves the analogous assertion for even kk and gives counterexamples when kk is odd and not a prime power. The odd-prime-power case is posed as the remaining natural case, and no resolution is supplied in the given text.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Marthe Bonamy, Natasha Morrison and Alex Scott, “Partitioning the vertices of a torus into isomorphic subgraphs”, arXiv:1710.07255 (2020).

Solutions 0

No solutions have been posted yet.