Hypergraphs with arbitrarily small codegree Tur\'an density

MaRDI QIDQ6442812zbMATH OpenFDO

Authors Simón Piga, Bjarne Schülke

Publication date 6 July 2023

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal combinatorics (05D99)

Abstract: Let $kgeq3$. Given a $k$-uniform hypergraph $H$, the minimum codegree $delta(H)$ is the largest $dinmathbbN$ such that every $(k-1)$-set of $V(H)$ is contained in at least $d$ edges. Given a $k$-uniform hypergraph $F$, the codegree Tur'an density $gamma(F)$ of $F$ is the smallest $gammain[0,1]$ such that every $k$-uniform hypergraph on $n$ vertices with $delta(H)geq(gamma+o(1))n$ contains a copy of $F$. Similarly as other variants of the hypergraph Tur'an problem, determining the codegree Tur'an density of a hypergraph is in general notoriously difficult and only few results are known. In this work, we show that for every $varepsilon>0$, there is a $k$-uniform hypergraph $F$ with $0<gamma(F)<varepsilon$. This is in contrast to the classical Tur'an density, which cannot take any value in the interval $(0,k!/k^k)$ due to a fundamental result by ErdH{o}s.

This page was built for publication: Hypergraphs with arbitrarily small codegree Tur\'an density

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