Turan numbers of complete 3-uniform Berge-hypergraphs

TL;DR

This paper determines the maximum number of edges in 3-uniform hypergraphs on N vertices that avoid containing any complete 3-uniform Berge-hypergraph of order n, for n ≥ 13, and characterizes the extremal structures.

Contribution

It provides an exact calculation of the Turán number for complete 3-uniform Berge-hypergraphs of order n (n ≥ 13) and describes the extremal hypergraphs.

Findings

Exact Turán number for N-vertex hypergraphs avoiding ^{(3)}_n.

Characterization of extremal hypergraphs avoiding ^{(3)}_n.

Results hold for n b1 13.

Abstract

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 member of $\mathcal{F}$ as a subgraph. For given $r\geq 3$, a complete $r$-uniform Berge-hypergraph, denoted by { ${K}_n^{(r)}$}, is an $r$-uniform hypergraph of order $n$ with the core sequence $v_{1}, v_{2}, \ldots ,v_{n}$ as the vertices and distinct edges $e_{ij},$ $1\leq i<j\leq n,$ where every $e_{ij}$ contains both $v_{i}$ and $v_{j}$. Let $\mathcal{F}^{(r)}_n$ be the family of complete $r$-uniform Berge-hypergraphs of order $n.$ We determine precisely $ex(N,\mathcal{F}^{(3)}_{n})$ for $n \geq 13$. We also find the extremal hypergraphs avoiding $\mathcal{F}^{(3)}_{n}$.