An extension of the Ruzsa-Szemerédi theorem

DOI10.1007/S00493-005-0006-6zbMATH Open1065.05068OpenAlexW1965520462MaRDI QIDQ558315FDOQ558315

Authors: Gábor N. Sárközy, Stanley 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

Recommendations

• On an extremal hypergraph problem of Brown, Erdős and Sós
• On a Turán-type hypergraph problem of Brown, Erdős and T. Sós
• Proof of the Brown-Erdős-Sós conjecture in groups
• Sparse hypergraphs: new bounds and constructions
• Extremal problems on set systems

zbMATH Keywords

uniform hypergraph

Mathematics Subject Classification ID

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

Cited In (28)

• Uniform hypergraphs containing no grids
• A note on the Brown-Erdős-Sós conjecture in groups
• Proof of the Brown-Erdős-Sós conjecture in groups
• Constructing dense grid-free linear 3-graphs
• Sparse hypergraphs with applications to coding theory
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• On a Turán-type hypergraph problem of Brown, Erdős and T. Sós
• A QUANTITATIVE EXTENSION OF SZLENK’S THEOREM
• Degenerate Turán Densities of Sparse Hypergraphs II: A Solution to the Brown-Erdős-Sós Problem for Every Uniformity
• An extension of a result of Ribe
• Turán problems and shadows. I: Paths and cycles
• Approximate Steiner (r − 1, r, n)‐systems without three blocks on r + 2 points
• Title not available (Why is that?)
• Turán numbers and batch codes
• On an extremal hypergraph problem of Brown, Erdős and Sós
• Local-vs-global combinatorics
• Small cores in 3-uniform hypergraphs
• An Extension of the Lemma of Rasiowa and Sikorski
• Triple systems with no three triples spanning at most five points
• Turán and Ramsey numbers in linear triple systems
• Turán and Ramsey numbers in linear triple systems. II
• A new bound for the Brown-Erdős-Sós problem
• Number on the forehead protocols yielding dense Ruzsa-Szemerédi graphs and hypergraphs
• A Ramsey variant of the Brown-Erdős-Sós conjecture
• Sparse hypergraphs: new bounds and constructions
• The length of an s-increasing sequence of r-tuples
• Degenerate Turán densities of sparse hypergraphs
• 2-cancellative hypergraphs and codes

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

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