Homogeneous edge-disjoint K2s and Tst,t unions

Abstract

Let r>2 and σ∈(0,r-1) be integers. We require t<2s, where t=2σ+1-1 and s=2r-σ-1. Generalizing a known \K4,T6,3\-ultrahomogenous graph G31, we find that a finite, connected, undirected, arc-transitive graph Grσ exists each of whose edges is shared by just two maximal subgraphs, namely a clique X0=K2s and a t-partite regular-Tur\'an graph X1=Tst,t on s vertices per part. Each copy Y of Xi (i=0,1) in Grσ shares each edge with just one copy of X1-i and all such copies of X1-i are pairwise distinct. Moreover, Grσ is an edge-disjoint union of copies of Xi, for i=0,1. We prove that Grσ is \K2s,Tst,t\-homogeneous if t<2s, and just \Tst,t\-homogeneous otherwise, meaning that there is an automorphism of Grσ between any two such copies of Xi relating two preselected arcs.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…