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.

生成讲解博客的中文版本

生成AI智能校验的中文版本