Pages that link to "Item:Q558315"

The following pages link to An extension of the Ruzsa-Szemerédi theorem (Q558315):

Displaying 22 items.

• Small cores in 3-uniform hypergraphs (Q345139) (← links)
• Uniform hypergraphs containing no grids (Q390731) (← links)
• Turán problems and shadows. I: Paths and cycles (Q472166) (← links)
• Turán and Ramsey numbers in linear triple systems. II (Q2092409) (← links)
• A new bound for the Brown-Erdős-Sós problem (Q2101162) (← links)
• Sparse hypergraphs: new bounds and constructions (Q2222044) (← links)
• Turán and Ramsey numbers in linear triple systems (Q2222956) (← links)
• Degenerate Turán densities of sparse hypergraphs (Q2306000) (← links)
• Turán numbers and batch codes (Q2345596) (← links)
• On a Turán-type hypergraph problem of Brown, Erdős and T. Sós (Q2566157) (← links)
• 2-Cancellative Hypergraphs and Codes (Q2883859) (← links)
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
• Proof of the Brown–Erdős–Sós conjecture in groups (Q4958663) (← links)
• A note on the Brown–Erdős–Sós conjecture in groups (Q4993109) (← links)
• A Ramsey variant of the Brown–Erdős–Sós conjecture (Q5021660) (← links)
• Sparse Hypergraphs with Applications to Coding Theory (Q5130902) (← links)
• Constructing dense grid-free linear $3$-graphs (Q5164032) (← links)
• Triple systems with no three triples spanning at most five points (Q5229522) (← links)
• The length of an <i>s</i>-increasing sequence of <i>r</i>-tuples (Q5886106) (← links)
• Degenerate Turán Densities of Sparse Hypergraphs II: A Solution to the Brown-Erdős-Sós Problem for Every Uniformity (Q6046820) (← links)
• Approximate Steiner (<i>r</i> − 1, <i>r</i>, <i>n</i>)‐systems without three blocks on <i>r</i> + 2 points (Q6185555) (← links)
• Local-vs-global combinatorics (Q6198642) (← links)