On asymmetric hypergraphs

MaRDI QIDQ6368163zbMATH OpenFDO

Authors Yiting Jiang, J. Nešetřil

Publication date 20 May 2021

Abstract: In this paper, we prove that for any $kge3$, there exist infinitely many minimal asymmetric $k$-uniform hypergraphs. This is in a striking contrast to $k=2$, where it has been proved recently that there are exactly $18$ minimal asymmetric graphs. We also determine, for every $kge1$, the minimum size of an asymmetric $k$-uniform hypergraph.

This page was built for publication: On asymmetric hypergraphs

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