Asymptotic solution of a Turán-type problem
From MaRDI portal
Let f(n,k) be the maximum number of edges in a 2k-uniform hypergraph on n vertices which does not contain edges of the form \(A\cup B\), \(A\cup C\), \(B\cup C\) where A, B and C are disjoint k-element sets. The following theorem (related to a problem of B. Bollabás) is proved: \[ (\frac{1}{2}+\frac{c}{n^ 2})/\left( \begin{matrix} n\\ 2k\end{matrix} \right)<f(n,k)<(\frac{1}{2}+\frac{2k}{n-4k})\left( \begin{matrix} n\\ 2k\end{matrix} \right), \] where \(c=c(k)>0\) is a constant. Finally the structure of an extremal hypergraph is conjectured.
Recommendations
- scientific article; zbMATH DE number 736291
- On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
- scientific article; zbMATH DE number 4200236
- On a Turán-type hypergraph problem of Brown, Erdős and T. Sós
- On an extremal hypergraph problem of Brown, Erdős and Sós
Cites work
- A new generalization of the Erdős-Ko-Rado theorem
- Extremal problems whose solutions are the blowups of the small Witt- designs
- scientific article; zbMATH DE number 3467166 (Why is no real title available?)
- scientific article; zbMATH DE number 3224335 (Why is no real title available?)
- On extremal problems of graphs and generalized graphs
- Three-graphs without two triples whose symmetric difference is contained in a third
- Union-free hypergraphs and probability theory
Cited in
(27)- Exact solution of some Turán-type problems
- On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
- Asymptotic solution of the Turán problem for some hypergraphs
- On \(k\)-uniform random hypergraphs without generalized fans
- A hypergraph extension of Turán's theorem
- Co-degree density of hypergraphs
- High dimensional Hoffman bound and applications in extremal combinatorics
- 2-cancellative hypergraphs and codes
- scientific article; zbMATH DE number 4200236 (Why is no real title available?)
- scientific article; zbMATH DE number 4156486 (Why is no real title available?)
- On Extremal k-Graphs Without Repeated Copies of 2-Intersecting Edges
- scientific article; zbMATH DE number 4008442 (Why is no real title available?)
- scientific article; zbMATH DE number 4031696 (Why is no real title available?)
- scientific article; zbMATH DE number 736291 (Why is no real title available?)
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
- Counting substructures. II: Hypergraphs
- scientific article; zbMATH DE number 4193691 (Why is no real title available?)
- A note on a Turán-type extremal question on 3-graphs
- An asymptotic resolution of a conjecture of Szemerédi and Petruska
- Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs
- Extremal Problems for Hypergraph Blowups of Trees
- Hypergraphs with independent neighborhoods
- When entropy meets Turán: new proofs and hypergraph Turán results
- Tight bounds for rainbow partial F-tiling in edge-colored complete hypergraphs
- A criterion for Andrásfai-Erdős-Sós type theorems and applications
- A new generalization of Mantel's theorem to \(k\)-graphs
- Constructions of non-principal families in extremal hypergraph theory
This page was built for publication: Asymptotic solution of a Turán-type problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2276984)
