Shadow of Hypergraphs with Bounded Degree

DOI10.1007/S00373-023-02634-YMaRDI QIDQ6377864arXivFDO

Authors Attila Jung

Publication date 16 September 2021

Published in arXiv

Full work available at URL https://doi.org/10.1007/S00373-023-02634-Y

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Extremal set theory (05D05)

arXiv classification

math.CO

Abstract: We study the size of the shadow of $k$-uniform hypergraphs with bounded degree. Lower bounds on the ratio of the size of the shadow and the size of the hypergraph are given as a function of the degree bound and $k$. We show that cliques are extremal for a long range of degree bounds, but not for every bound. We give a general, but not sharp lower bound on the shadow ratio and show, that sometimes we can get extremal hypergraphs by deleting disjoint maximal matchings from a clique.

This page was built for publication: Shadow of Hypergraphs with Bounded Degree

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