Invariant covers of multipartite hypergraphs

Read full text
Authors: Anton Aleksandrovich Klyachko, Mikhail Sergeevich Terekhov
Cited by: 0

Abstract

We prove the following ``symmetric analogue'' of Lovász's estimate (1975): if an $r$-partite hypergraph of rank $r\geqslant2$ has a cover of cardinality $n

Fields of Study & Subjects

Limits and Structures in Graph Theory Advanced Combinatorial Mathematics Advanced Graph Theory Research

Publication details

Journal / source
arXiv (Cornell University)
Publication date
11 February 2026
Language
EN
Document type
Preprint