On a vec{C}₄-ultrahomogeneous oriented graph
classification
🧮 math.CO
keywords
graphpencilsultrahomogeneousorderedorientedadaptedalteringarc-disjoint
read the original abstract
The notion of a $\mathcal C$-ultrahomogeneous graph, due to Isaksen et al., is adapted for digraphs, and subsequently a strongly connected $\vec{C}_4$-ultrahomogeneous oriented graph on 168 vertices and 126 pairwise arc-disjoint 4-cycles is presented, with regular indegree and outdegree 3 and no circuits of lengths 2 and 3, by altering a definition of the Coxeter graph via pencils of ordered lines of the Fano plane in which pencils are replaced by ordered pencils.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.