Minimal decompositions of graphs into mutually isomorphic subgraphs (Q1167190): Difference between revisions

Let \(G=\{G_1,\dots,G_k\}\) be a collection of \(n\)-vertex graphs each with the same (unspecified) number of edges. Let \(U(G)\) be the least \(r\) for which there exists a set of partitions of the edge sets \(E(G_i)\) of the graph into \(r\) parts, say \(E(G_i)=\cup_{j=1}^{r} E_{ij}\), such that for each j, all the \(E_{ij}\) are isomorphic as graphs, \(1\leq i\leq k\). Let \(U_k(n)\) denote the largest value \(U(G)\) can take with G as above. The authors and other earlier showed [Congr. Numerantium 23, 3-18 (1979; Zbl 0434.05046)] that \(U_2(n)=2n/3+o()\) as \(n\to\infty\). Here they show \(U_k(n)=3n/4+o(n)\) for any fixed \(k\geq 3\), as \(n\to\infty\). The difficult part of the proof is the establishment of the upper bound. Broadly speaking, it is done by successively removing subgraphs which are shown to be common to all the \(G_i\), where the subgraph removed at any state depends on the number of edges in the \(G_i\).