New bounds for a hypergraph Bipartite Turán problem

2019/02/26 by Beka Ergemlidze, Tao Jiang, Ergemlidze, Beka +3
Mathematics · #Limits and Structures in Graph Theory #Mathematical Approximation and Integration

paper · pdf · doi:10.48550/arxiv.1902.10258

Abstract

Let t be an integer such that t≥ 2. Let K_2,t⁽³⁾ denote the triple system consisting of the 2t triples \a,x_i,y_i\, \b,x_i,y_i\ for 1 ≤ i ≤ t, where the elements a, b, x₁, x₂, …, x_t, y₁, y₂, …, y_t are all distinct. Let ex(n,K_2,t⁽³⁾) denote the maximum size of a triple system on n elements that does not contain K_2,t⁽³⁾. This function was studied by Mubayi and Verstraëte, where the special case t=2 was a problem of Erdős that was studied by various authors. Mubayi and Verstraëte proved that ex(n,K_2,t⁽³⁾)

Citations

• On Representatives of Subsets

Related

• Asymptotics of the hypergraph bipartite Turán problem
• A hypergraph bipartite Turán problem with odd uniformity
• Hypergraphs with many extremal configurations
• A hypergraph Turán problem with no stability
• On local Turán problems