On a $\vec{C}_4$-ultrahomogeneous oriented graph
Combinatorics
2009-11-14 v6
Abstract
The notion of a -ultrahomogeneous graph, due to Isaksen et al., is adapted for digraphs, and subsequently a strongly connected -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.
Keywords
Cite
@article{arxiv.0905.3172,
title = {On a $\vec{C}_4$-ultrahomogeneous oriented graph},
author = {Italo J. Dejter},
journal= {arXiv preprint arXiv:0905.3172},
year = {2009}
}
Comments
4 pages, 2 figures, 2 tables