An extension of the Ruzsa-Szemerédi theorem

DOI10.1007/s00493-005-0006-6zbMath1065.05068OpenAlexW1965520462MaRDI QIDQ558315

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

Publication date: 5 July 2005

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-005-0006-6

zbMATH Keywords

uniform hypergraph

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (22)

2-Cancellative Hypergraphs and Codes ⋮ The length of an s-increasing sequence of r-tuples ⋮ Small cores in 3-uniform hypergraphs ⋮ 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 ⋮ Local-vs-global combinatorics ⋮ Sparse Hypergraphs with Applications to Coding Theory ⋮ Sparse hypergraphs: new bounds and constructions ⋮ Turán and Ramsey numbers in linear triple systems ⋮ Turán problems and shadows. I: Paths and cycles ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Constructing dense grid-free linear $3$-graphs ⋮ Proof of the Brown–Erdős–Sós conjecture in groups ⋮ Degenerate Turán densities of sparse hypergraphs ⋮ Triple systems with no three triples spanning at most five points ⋮ A note on the Brown–Erdős–Sós conjecture in groups ⋮ On a Turán-type hypergraph problem of Brown, Erdős and T. Sós ⋮ 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 ⋮ A Ramsey variant of the Brown–Erdős–Sós conjecture

This page was built for publication: An extension of the Ruzsa-Szemerédi theorem