On the Automorphism Group of the Substructure Ordering of Finite Directed Graphs

Publication date 13 September 2022

Partial orders, general (06A06) Combinatorics of partially ordered sets (06A07) Computer assisted proofs of proofs-by-exhaustion type (68V05)

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

(m a t h b b Z_{2}^{4} i m e s S_{4}) t i m e s_{a l p h a} m a t h b b Z_{2}

. 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.

This page was built for publication: On the Automorphism Group of the Substructure Ordering of Finite Directed Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6410554)