Related papers: On the Tur\'an density of $\{1, 3\}$-Hypergraphs

The uniform Tur\'an density $\pi_{1}(F)$ of a $3$-uniform hypergraph $F$ is the supremum over all $d$ for which there is an $F$-free hypergraph with the property that every linearly sized subhypergraph with density at least $d$. Determining…

Let $H_k^r$ denote an $r$-uniform hypergraph with $k$ edges and $r+1$ vertices, where $k \leq r+1$ (it is easy to see that such a hypergraph is unique up to isomorphism). The known general bounds on its Tur\'{a}n density are $\pi(H_k^r)…

P. Erd\H{o}s [On extremal problems of graphs and generalized graphs, Israel Journal of Mathematics 2 (1964), 183-190] characterised those hypergraphs $F$ that have to appear in any sufficiently large hypergraph $H$ of positive density. We…

Given a $k$-graph $H$ a complete blow-up of $H$ is a $k$-graph $\hat{H}$ formed by replacing each $v\in V(H)$ by a non-empty vertex class $A_v$ and then inserting all edges between any $k$ vertex classes corresponding to an edge of $H$.…

For fixed integers $r\ge 3, e\ge 3$, and $v\ge r+1$, let $f_r(n,v,e)$ denote the maximum number of edges in an $n$-vertex $r$-uniform hypergraph in which the union of arbitrary $e$ distinct edges contains at least $v+1$ vertices. In 1973,…

Given an $r$-graph $H$ on $h$ vertices, and a family $\mathcal{F}$ of forbidden subgraphs, we define $\ex_{H}(n, \mathcal{F})$ to be the maximum number of induced copies of $H$ in an $\mathcal{F}$-free $r$-graph on $n$ vertices. Then the…

Let $r\ge 3$. Given an $r$-graph $H$, the minimum codegree $\delta_{r-1}(H)$ is the largest integer $t$ such that every $(r-1)$-subset of $V(H)$ is contained in at least $t$ edges of $H$. Given an $r$-graph $F$, the codegree Tur\'an density…

Grosu [On the algebraic and topological structure of the set of Tur\'{a}n densities. \emph{J. Combin. Theory Ser. B} \textbf{118} (2016) 137--185] asked if there exist an integer $r\ge 3$ and a finite family of $r$-graphs whose Tur\'{a}n…

For integers $q\ge p\ge r\ge2$, we say that an $r$-uniform hypergraph $H$ has property $(q,p)$, if for any $q$-vertex subset $Q$ of $V(H)$, there exists a $p$-vertex subset $P$ of $Q$ spanning a clique in $H$. Let $T_{r}(n,q,p)=\min\{ e(H):…

In the 1980s, Erd\H{o}s and S\'os initiated the study of Tur\'an hypergraph problems with a uniformity condition on the distribution of edges, i.e., determining density thresholds for the existence of a hypergraph H in a host hypergraph…

Let $H$ be a $k$-graph (i.e. a $k$-uniform hypergraph). Its minimum codegree $\delta_{k-1}(H)$ is the largest integer $t$ such that every $(k-1)$-subset of $V(H)$ is contained in at least $t$ edges of~$H$. The \emph{codegree Tur\'an…

Let $P$ denote a 3-uniform hypergraph consisting of 7 vertices $a,b,c,d,e,f,g$ and 3 edges $\{a,b,c\}, \{c,d,e\},$ and $\{e,f,g\}$. It is known that the $r$-colored Ramsey number for $P$ is $R(P;r)=r+6$ for $r=2,3$, and that $R(P;r)\le 3r$…

Since its formulation, Tur\'an's hypergraph problems have been among the most challenging open problems in extremal combinatorics. One of them is the following: given a $3$-uniform hypergraph $\mathcal{F}$ on $n$ vertices in which any five…

Given a family $\mathcal{F}$ of $r$-graphs, the Tur\'{a}n number of $\mathcal{F}$ for a given positive integer $N$, denoted by $ex(N,\mathcal{F})$, is the maximum number of edges of an $r$-graph on $N$ vertices that does not contain any…

Let $K^{(r)}_{s_1,s_2,\cdots,s_r}$ be the complete $r$-partite $r$-uniform hypergraph and $ex(n,K^{(r)}_{s_1,s_2,\cdots,s_r})$ be the maximum number of edges in any $n$-vertex $K^{(r)}_{s_1,s_2,\cdots,s_r}$-free $r$-uniform hypergraph. It…

In the 1980s, Erd\H{o}s and S\'os first introduced an extremal problem on hypergraphs with density constraints. Given an $r$-uniform hypergraph $F$ (or $r$-graph for short), its uniform Tur\'an density $\pi_u(F)$ is the smallest value of…

We study the codegree Tur\'an density of $\mathcal{C}_\ell^r$, the $r$-uniform hypergraph tight cycle of length $\ell$. A result of Han, Lo, and Sanhueza-Matamala states that if $\ell$ is sufficiently large and $r/\gcd(r,\ell)$ is even,…

For a $k$-uniform hypergraph (or simply $k$-graph) $F$, the codegree Tur\'{a}n density $\pi_{\mathrm{co}}(F)$ is the infimum over all $\alpha$ such that any $n$-vertex $k$-graph $H$ with every $(k-1)$-subset of $V(H)$ contained in at least…

The Lagrangian density of an $r$-uniform hypergraph $F$ is $r!$ multiplying the supremum of the Lagrangians of all $F$-free $r$-uniform hypergraphs. For an $r$-graph $H$ with $t$ vertices, it is clear that $\pi_{\lambda}(H)\ge…

An ordered graph $H$ is a simple graph with a linear order on its vertex set. The corresponding Tur\'an problem, first studied by Pach and Tardos, asks for the maximum number $\text{ex}_<(n,H)$ of edges in an ordered graph on $n$ vertices…