On the Automorphism Group of the Substructure Ordering of Finite Directed Graphs
Combinatorics
2022-11-29 v2
Abstract
We investigate the automorphism group of the substructure ordering of finite directed graphs. The second author conjectured that it is isomorphic to the 768-element group . Though unable to prove it, we solidify this conjecture by showing that the automorphism group behaves as expected by the conjecture on the first few levels of the poset in question. With the use of computer calculation we analyze the first four levels holding 3160 directed graphs.
Cite
@article{arxiv.2209.05820,
title = {On the Automorphism Group of the Substructure Ordering of Finite Directed Graphs},
author = {Fanni K. Nedényi and Ádám Kunos},
journal= {arXiv preprint arXiv:2209.05820},
year = {2022}
}