The number of \(k\)-dimensional corner-free subsets of grids

DOI10.37236/9424zbMath1492.05151arXiv2012.03187OpenAlexW3113250605MaRDI QIDQ2152792

Younjin Kim

Publication date: 11 July 2022

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

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

zbMATH Keywords

Szemerédi's theorem\(k\)-dimensional corner-free subsets of a grid

Mathematics Subject Classification ID

Extremal set theory (05D05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hypergraph containers
• Sets of integers that do not contain long arithmetic progressions
• An ergodic Szemerédi theorem for commuting transformations
• A new proof of Szemerédi's theorem for arithmetic progressions of length four
• An improved construction of progression-free sets
• A density version of the Hales-Jewett theorem
• The primes contain arbitrarily long arithmetic progressions
• Hypergraph regularity and the multidimensional Szemerédi theorem
• On Certain Sets of Positive Density
• Lower bounds for corner-free sets
• ON A GENERALIZATION OF SZEMERÉDI'S THEOREM
• A new proof of Roth’s theorem on arithmetic progressions
• On sets of integers containing k elements in arithmetic progression
• The Number of Subsets of Integers with Nok-Term Arithmetic Progression
• Larger Corner-Free Sets from Better NOF Exactly-$N$ Protocols
• Logarithmic bounds for Roth's theorem via almost-periodicity
• Independent sets in hypergraphs
• On a problem of Gowers
• The counting lemma for regular k‐uniform hypergraphs
• On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
• A new proof of Szemerédi's theorem

This page was built for publication: The number of \(k\)-dimensional corner-free subsets of grids