2021/11/15 by Jiang, Yiting, Nesetril, Jaroslav
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2111.08077
In this paper, we prove that for any k≥ 3, 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 k≥ 1, the minimum size of an asymmetric k-uniform hypergraph.