Homogeneous edge-disjoint $K_{2s}$ and $T_{st,t}$ unions
Combinatorics
2021-07-06 v9
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\'an 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.
Keywords
Cite
@article{arxiv.0704.2146,
title = {Homogeneous edge-disjoint $K_{2s}$ and $T_{st,t}$ unions},
author = {Italo J. Dejter},
journal= {arXiv preprint arXiv:0704.2146},
year = {2021}
}
Comments
23 pages, 1 table