A note on asymmetric hypergraphs

MaRDI QIDQ6435098zbMATH OpenFDO

Authors Dominik Bohnert, Christian Winter

Publication date 2 May 2023

Abstract: A $k$-graph $mathcalG$ is asymmetric if there does not exist an automorphism on $mathcalG$ other than the identity, and $mathcalG$ is called minimal asymmetric if it is asymmetric but every non-trivial induced sub-hypergraph of $mathcalG$ is non-asymmetric. Extending a result of Jiang and Nev{s}etv{r}il, we show that for every $k$-graph, $kge3$, there exist infinitely many minimal asymmetric $k$-graphs which have maximum degree $2$ and are linear. Further, we show that there are infinitely many $2$-regular asymmetric $k$-graphs for $kge3$.

This page was built for publication: A note on asymmetric hypergraphs

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