On a Turán-type hypergraph problem of Brown, Erdős and T. Sós

DOI10.1016/j.disc.2005.05.002zbMath1079.05063OpenAlexW2096625536MaRDI QIDQ2566157

Stanley M. Selkow, Gábor N. Sárközy

Publication date: 22 September 2005

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.05.002

zbMATH Keywords

extremal

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Related Items (12)

2-Cancellative Hypergraphs and Codes ⋮ Uniform hypergraphs containing no grids ⋮ Degenerate Turán Densities of Sparse Hypergraphs II: A Solution to the Brown-Erdős-Sós Problem for Every Uniformity ⋮ Approximate Steiner (r − 1, r, n)‐systems without three blocks on r + 2 points ⋮ Sparse Hypergraphs with Applications to Coding Theory ⋮ Sparse hypergraphs: new bounds and constructions ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Note on the 3-graph counting Lemma ⋮ Degenerate Turán densities of sparse hypergraphs ⋮ Turán and Ramsey numbers in linear triple systems. II ⋮ A new bound for the Brown-Erdős-Sós problem ⋮ Turán numbers and batch codes

Cites Work

• An extension of the Ruzsa-Szemerédi theorem
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• What we know and what we do not know about Turán numbers
• On the existence of triangulated spheres in 3-graphs, and related problems
• Extremal problems on set systems
• On coloring graphs to maximize the proportion of multicolored k-edges
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On a Turán-type hypergraph problem of Brown, Erdős and T. Sós