Some Exact Results and New Asymptotics for Hypergraph Turán Numbers (Q3147240)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1802788
Language Label Description Also known as
default for all languages
No label defined
    English
    Some Exact Results and New Asymptotics for Hypergraph Turán Numbers
    scientific article; zbMATH DE number 1802788

      Statements

      Some Exact Results and New Asymptotics for Hypergraph Turán Numbers (English)
      0 references
      0 references
      2002
      0 references
      regular hypergraph
      0 references
      Given a family of \(r\)-uniform hypergraphs \({\mathcal F}\), an \(r\)-uniform hypergraph \({\mathcal G}\) is said to be \({\mathcal F}\)-free if it contains no subgraphs isomorphic to any element of \({\mathcal F}\). By \(\text{ ex}(n,{\mathcal F})\) we denote the maximum number of edges of an \({\mathcal F}\)-free hypergraph. Let \(C_4^{(r)}\) be the family of \(r\)-uniform hypergraphs with edges \(A\), \(B\), \(C\), \(D\), such that \(A\cap B=C\cap D = \emptyset\) and \(A\cup B=C\cup D\). For \(s_1\leq\dots \leq s_r\), let \(K^{(r)} (s_1,\dots ,s_r)\) be the complete \(r\)-partite \(r\)-uniform hypergraph with vertex set consisting of disjoint sets \(X_1,\dots , X_r\) of sizes \(s_1,\dots, s_r\), respectively, and all edges of the form \(\{x_1,\dots,x_r\}\), where \(x_i\in X_i\). It is proven that \[ \text{ ex} (n, \{ C_4^{(3)}, K^{(3)}(1,2,4) \}) \leq {n \choose 2}. \] In addition to that, a generalization of a well-known conjecture for the Turán numbers of bipartite graphs is given.
      0 references

      Identifiers