A Note on Asymmetric Hypergraphs

Abstract A k -graph $$\mathcal {G}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>G</mml:mi> </mml:math> is asymmetric if there does not exist an automorphism on $$\mathcal {G}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>G</mml:mi> </mml:math> other than the identity, and $$\mathcal {G}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>G</mml:mi> </mml:math> is called minimal asymmetric if it is asymmetric but every non-trivial induced sub-hypergraph of $$\mathcal {G}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>G</mml:mi> </mml:math> is non-asymmetric. Extending a result of Jiang and Nešetřil (J Comb Theory Ser B 164: 105–118, 2024), we show that for every $$k\ge 3$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>k</mml:mi> <mml:mo>≥</mml:mo> <mml:mn>3</mml:mn> </mml:mrow> </mml:math> , 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 $$k\ge 3$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>k</mml:mi> <mml:mo>≥</mml:mo> <mml:mn>3</mml:mn> </mml:mrow> </mml:math> .