Invariant covers of multipartite hypergraphs

Abstract

We prove the following ``symmetric analogue'' of Lov\'asz's estimate (1975): if an r-partite hypergraph of rank r≥slant2 has a cover of cardinality n<∞, then it admits a cover of cardinality at most nr/2, which is invariant with respect to all automorphisms preserving the parts. We obtain also symmetric analogues of generalisations of Lov\'asz's estimate due to Aharoni, Holzman, and Krivelevich (1996).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…