Homogeneous edge-disjoint and unions
arXiv:0704.2146
Abstract
Let and be integers. We require , where and . Generalizing a known -ultrahomogenous graph , we find that a finite, connected, undirected, arc-transitive graph exists each of whose edges is shared by just two maximal subgraphs, namely a clique and a -partite regular-Turán graph on vertices per part. Each copy of () in shares each edge with just one copy of and all such copies of are pairwise distinct. Moreover, is an edge-disjoint union of copies of , for . We prove that is -homogeneous if , and just -homogeneous otherwise, meaning that there is an automorphism of between any two such copies of relating two preselected arcs.
arXiv comment23 pages, 1 table