On \(r\)-uniform linear hypergraphs with no Berge-\(K_{2,t}\)

zbMath1376.05104arXiv1609.03401MaRDI QIDQ1684649

Craig Timmons

Publication date: 12 December 2017

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Sidon sets; Berge-\(K_{2,t}\); hypergraph Turán problem

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C65: Hypergraphs

05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)

05D99: Extremal combinatorics

Related Items

$t$-Wise Berge and $t$-Heavy Hypergraphs, Nearly-Regular Hypergraphs and Saturation of Berge Stars, Uniformity thresholds for the asymptotic size of extremal Berge-\(F\)-free hypergraphs, Uniformity thresholds for the asymptotic size of extremal Berge-\(F\)-free hypergraphs, Planar polynomials and an extremal problem of Fischer and Matoušek, Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs, Turán numbers for Berge-hypergraphs and related extremal problems, Saturation of Berge hypergraphs, Spectral extremal results for hypergraphs, Hypergraph based Berge hypergraphs, Generalized Turán problems for complete bipartite graphs, A linear hypergraph extension of Turán's theorem, The exact linear Turán number of the sail, Turán numbers for hypergraph star forests, A linear hypergraph extension of the bipartite Turán problem, Asymptotics for the Turán number of Berge-\(K_{2,t}\), Linearity of saturation for Berge hypergraphs

Cites Work

• Turán numbers of bipartite graphs plus an odd cycle
• Hypergraphs with no cycle of length 4
• 3-uniform hypergraphs avoiding a given odd cycle
• A counterexample to sparse removal
• On 3-uniform hypergraphs without a cycle of a given length
• Pentagons vs. triangles
• On hypergraphs of girth five
• New asymptotics for bipartite Turán numbers
• Hypergraph Extensions of the Erdős-Gallai Theorem
• The Maximum Number of Triangles in C_2k+1-Free Graphs
• Hypergraphs with No Cycle of a Given Length
• Solving a linear equation in a set of integers I
• Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers
• Extremal Results for Berge Hypergraphs
• Many \(T\) copies in \(H\)-free graphs