Partitioning the vertices of a torus into isomorphic subgraphs
Let H be an induced subgraph of the torus Ckm. We show that when k≥3 is even and |V(H)| divides some power of k, then for sufficiently large n the torus Ckn has a perfect vertex-packing with induced copies of H. On the other hand, disproving a conjecture of Gruslys, we show that when k is...
Huvudupphovsmän: | Bonamy, M, Morrison, N, Scott, A |
---|---|
Materialtyp: | Journal article |
Språk: | English |
Publicerad: |
Elsevier
2020
|
Liknande verk
Liknande verk
-
On the First-Order Complexity of Induced Subgraph Isomorphism
av: Oleg Verbitsky, et al.
Publicerad: (2019-03-01) -
An Efficient Subgraph Isomorphism Solver for Large Graphs
av: Zubair Ali Ansari, et al.
Publicerad: (2021-01-01) -
SEARCH-TREE SIZE ESTIMATION FOR THE SUBGRAPH ISOMORPHISM PROBLEM
av: Uroš Čibej, et al.
Publicerad: (2019-01-01) -
Criminal Community Detection Based on Isomorphic Subgraph Analytics
av: Sangkaran Theyvaa, et al.
Publicerad: (2020-07-01) -
Partitioning Harary graphs into connected subgraphs containing prescribed vertices
av: Olivier Baudon, et al.
Publicerad: (2014-12-01)