A Turán theorem for extensions via an Erdős-Ko-Rado theorem for Lagrangians (Q2288364)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A Turán theorem for extensions via an Erdős-Ko-Rado theorem for Lagrangians |
scientific article |
Statements
A Turán theorem for extensions via an Erdős-Ko-Rado theorem for Lagrangians (English)
0 references
17 January 2020
0 references
An \(r\)-graph is an abbreviation for an \(r\)-uniform hypergraph. Let \(V(G)\), \(v(G)\), and \(e(G)\) denote the vertex set, the number of vertices, and the number of edges of an \(r\)-graph \(G\). Let \(\mathrm{Forb}((F)\) denote the class of all \(F\)-free \(r\)-graphs, i.e., \(r\)-graphs not containing \(F\) as subgraph. The Turán function \(\mathrm{ex}(n,F)\) is defined as \(\mathrm{ex}(n,F)= \max \{\mathrm{e}(G) : \mathrm{v}(G)=n, G \in \mathrm{Forb}(F)\}\). The extension of an \(r\)-graph \(F\), denoted by Ext\((F)\), is an \(r\)-graph obtained from \(F\) by adding a new edge for every uncovered pair of vertices containing this pair and \(r-2\) new vertices. The \(r\)-graph \(K_{r,r}^{(r)}\) is the extension of the \(r\)-graph consisting of two disjoint edges. An \(r\)-graph \(H\) is a star if its vertex set admits a partition \((A,B)\) such that \(|e \cap A|=1\) for every edge \(e\) of \(H\). Let \(S^{(r)}(n)\) denote the star on \(n\) vertices with the maximum number of edges. The main result established in this paper is the following. For every \(r \geq 4\), there exists \(n_0 := n_0(r)\) such that \(\mathrm{ex}(n,K_{r,r}^{(r)})= {\mathrm e}(S^{(r)}(n))\) for all \(n > n_0(r)\) and every \(K_{r,r}^{(r)}\)-free \(r\)-graph on \(n\) vertices with maximum number of edges is a star. \par The Lagrangian \(\lambda(F)\) of an \(r\)-graph \(F\) is defined as \(\lambda(F)=\max_p \sum_{e \in F} \prod_{v \in e}p(v)\), where the maximum is taken over all probability distributions \(p\) on the vertex set \(V(F)\). An \(r\)-graph \(H\) is intersecting if \(e \cap f \neq \emptyset\) for any pair of edges \(e\) and \(f\) of \(H\). Furthermore, \(H\) is principal if there is a vertex of \(H\) that intersects every edge of \(H\). The main result is derived from the following theorem proved in this paper. For every \(r \geq 4\) there exists a constant \(c_r\) such that, if \(H\) is a non-principal intersecting \(r\)-graph, then \(\lambda(H) < \frac{1}{r!}\left( (1-\frac{1}{r})^{r-1}- c_r \right)\).
0 references
\(r\)-graph
0 references
\(F\)-free \(r\)-graph
0 references
intersecting \(r\)-graph
0 references
principal \(r\)-graph
0 references
extension
0 references
star
0 references
Lagrangian
0 references