arXiv Analytics

Sign in

arXiv:0704.1493 [math.CO]AbstractReferencesReviewsResources

On a {K_4,K_{2,2,2}}-ultrahomogeneous graph

Italo J. Dejter

Published 2007-04-11, updated 2008-10-20Version 3

The existence of a connected 12-regular $\{K_4,K_{2,2,2}\}$-ultrahomogeneous graph $G$ is established, (i.e. each isomorphism between two copies of $K_4$ or $K_{2,2,2}$ in $G$ extends to an automorphism of $G$), with the 42 ordered lines of the Fano plane taken as vertices. This graph $G$ can be expressed in a unique way both as the edge-disjoint union of 42 induced copies of $K_4$ and as the edge-disjoint union of 21 induced copies of $K_{2,2,2}$, with no more copies of $K_4$ or $K_{2,2,2}$ existing in $G$. Moreover, each edge of $G$ is shared by exactly one copy of $K_4$ and one of $K_{2,2,2}$. While the line graphs of $d$-cubes, ($3\le d\in\ZZ$), are $\{K_d, K_{2,2}\}$-ultrahomogeneous, $G$ is not even line-graphical. In addition, the chordless 6-cycles of $G$ are seen to play an interesting role and some self-dual configurations associated to $G$ with 2-arc-transitive, arc-transitive and semisymmetric Levi graphs are considered.

Comments: 12 pages, 4 figures
Journal: Australasian Jour. of Combinatorics, 44 (2009), 63--75
Categories: math.CO
Subjects: 05C62
Related articles: Most relevant | Search more
arXiv:math/0404503 [math.CO] (Published 2004-04-27)
Edge distribution of graphs with few induced copies of a given graph
arXiv:2309.00190 [math.CO] (Published 2023-09-01)
Sprinkling with random regular graphs
arXiv:1612.04603 [math.CO] (Published 2016-12-14)
Almost partitioning the hypercube into copies of a graph