Maximum \(k\)-sum \(\mathbf{n}\)-free sets of the 2-dimensional integer lattice

DOI10.37236/8895zbMath1483.11039arXiv1903.04132OpenAlexW3090336338MaRDI QIDQ2205110

Ilkyoo Choi, Boram Park, Ringi Kim

Publication date: 20 October 2020

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

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

zbMATH Keywords

sum-free sets

Mathematics Subject Classification ID

Extremal set theory (05D05) Other combinatorial number theory (11B75) Arithmetic combinatorics; higher degree uniformity (11B30)

Related Items

Shape of the asymptotic maximum sum-free sets in integer lattice grids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Rado's boundedness conjecture
• Extremal subsets of \(\{1,\dots ,n\}\) avoiding solutions to linear equations in three variables
• Sharp bound on the number of maximal sum-free subsets of integers
• On the complexity of finding and counting solution-free sets of integers
• Research problems from the 19th British Combinatorial Conference
• Studien zur Kombinatorik
• The complexity of solution-free sets of integers for general linear equations
• On solution-free sets of integers
• On sumfree subsets of hypercubes
• Notes on Sum-Free and Related Sets
• Solving a linear equation in a set of integers I
• THE CAMERON–ERDOS CONJECTURE
• Solving a linear equation in a set of integers II
• Maximal sum-free sets of integer lattice grids
• On solution-free sets of integers II