English

Homogeneous edge-disjoint $K_{2s}$ and $T_{st,t}$ unions

Combinatorics 2021-07-06 v9

Abstract

Let r>2r>2 and σ(0,r1)\sigma\in(0,r-1) be integers. We require t<2st<2s, where t=2σ+11t=2^{\sigma+1}-1 and s=2rσ1s=2^{r-\sigma-1}. Generalizing a known {K4,T6,3}\{K_4,T_{6,3}\}-ultrahomogenous graph G31G_3^1, we find that a finite, connected, undirected, arc-transitive graph GrσG_r^\sigma exists each of whose edges is shared by just two maximal subgraphs, namely a clique X0=K2sX_0=K_{2s} and a tt-partite regular-Tur\'an graph X1=Tst,tX_1=T_{st,t} on ss vertices per part. Each copy YY of XiX_i (i=0,1i=0,1) in GrσG_r^\sigma shares each edge with just one copy of X1iX_{1-i} and all such copies of X1iX_{1-i} are pairwise distinct. Moreover, GrσG_r^\sigma is an edge-disjoint union of copies of XiX_i, for i=0,1i=0,1. We prove that GrσG_r^\sigma is {K2s,Tst,t}\{K_{2s},T_{st,t}\}-homogeneous if t<2st<2s, and just {Tst,t}\{T_{st,t}\}-homogeneous otherwise, meaning that there is an automorphism of GrσG_r^\sigma between any two such copies of XiX_i 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