Minimal asymmetric hypergraphs (Q6144395)

A hypergraph \(G\) is called asymmetric provided it has no non-identity automorphism. A hypergraph is minimal asymmetric if it is asymmetric and every non-trivial induced subgraph of \(G\) is symmetric. The authors of this paper prove that there are infinitely many minimal asymmetric \(k\)-uniform hypergraphs for \(k\geq 3\) (which is a striking contrast with the situation for \(k=2\), where it is known that there exist exactly \(18\) minimal asymmetric graphs, see [\textit{P. Schweitzer} and \textit{P. Schweitzer}, J. Comb. Theory, Ser. B 127, 215--227 (2017; Zbl 1371.05131)]). Also, for every \(k\geq 1\), the minimum size of an asymmetric \(k\)-uniform hypergraph is determined.