New bounds for a hypergraph bipartite Turán problem

DOI10.1016/J.JCTA.2020.105299MaRDI QIDQ2194765zbMATH OpenOpenAlexFDO

Authors Beka Ergemlidze, Tao Jiang, Abhishek Methuku

Publication date 7 September 2020

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1902.10258

zbMATH Keywords

bipartite Turándegenerate problemextremal hypergraphshypergraph Turán problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Abstract: Let $t$ be an integer such that $tgeq2$. Let $K_{2,t}^{(3)}$ denote the triple system consisting of the $2t$ triples $a,x_i,y_i$, $b,x_i,y_i$ for $1leilet$, where the elements $a,b,x_1,x_2,ldots,x_t,$ $y_1,y_2,ldots,y_t$ are all distinct. Let $ex(n,K_{2,t}^{(3)})$ denote the maximum size of a triple system on $n$ elements that does not contain $K_{2,t}^{(3)}$. This function was studied by Mubayi and Verstra"ete, where the special case $t=2$ was a problem of ErdH{o}s that was studied by various authors. Mubayi and Verstra"ete proved that $$ and that for infinitely many $n$, $$. These bounds together with a standard argument show that $$ exists and that [frac{2t-1}{3}leq g(t)leq t^4.] Addressing the question of Mubayi and Verstra"ete on the growth rate of $g(t)$, we prove that as $toinfty$, [g(t) = Theta(t^{1+o(1)}).]

Recommendations

• Some extremal results on hypergraph Turán problems
• A hypergraph extension of the bipartite Turán problem
• Turán number of bipartite graphs with no \(K_{t,t}\)
• New asymptotics for bipartite Turán numbers
• Infinite Turán problems for bipartite graphs

Cites work

• A hypergraph extension of the bipartite Turán problem
• scientific article; zbMATH DE number 5942358 (Why is no real title available?)
• scientific article; zbMATH DE number 3224335 (Why is no real title available?)
• Hypergraphs in which all disjoint pairs have distinct unions
• On coloring graphs to maximize the proportion of multicolored k-edges
• The maximum size of hypergraphs without generalized 4-cycles

Cited in

(6)

• Some extremal results on hypergraph Turán problems
• Forbidding \(K_{2,t}\) traces in triple systems
• Asymptotic improvements to the lower bound of certain bipartite Turán numbers
• New Turán Exponents for Two Extremal Hypergraph Problems
• Asymptotics of the hypergraph bipartite Turán problem
• A hypergraph bipartite Turán problem with odd uniformity

This page was built for publication: New bounds for a hypergraph bipartite Turán problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2194765)