Shadows of 3-Uniform Hypergraphs under a Minimum Degree Condition

DOI10.1137/21M1450227zbMATH Open1501.05031arXiv2103.13571OpenAlexW3205928828MaRDI QIDQ5043057

Author name not available (Why is that?)

Publication date: 27 October 2022

Published in: (Search for Journal in Brave)

Abstract: We prove a minimum degree version of the Kruskal--Katona theorem: given $dge1/4$ and a triple system $F$ on $n$ vertices with minimum degree at least $$, we obtain asymptotically tight lower bounds for the size of its shadow. Equivalently, for $tgen/2-1$, we asymptotically determine the minimum size of a graph on $n$ vertices, in which every vertex is contained in at least $$ triangles. This can be viewed as a variant of the Rademacher--Tur'an problem.

Full work available at URL: https://arxiv.org/abs/2103.13571

zbMATH Keywords

No records found.

Mathematics Subject Classification ID

No records found.

This page was built for publication: Shadows of 3-Uniform Hypergraphs under a Minimum Degree Condition

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