Pages that link to "Item:Q5834919"

The following pages link to On Sets of Integers Which Contain No Three Terms in Arithmetical Progression (Q5834919):

Displaying 50 items.

• Finite configurations in sparse sets (Q279766) (← links)
• Short proofs of some extremal results. II. (Q326811) (← links)
• On certain other sets of integers (Q351354) (← links)
• Nearly complete graphs decomposable into large induced matchings and their applications (Q363228) (← links)
• Uniform hypergraphs containing no grids (Q390731) (← links)
• Unique sequences containing no \(k\)-term arithmetic progressions (Q396958) (← links)
• Nearly equal distances in metric spaces (Q400532) (← links)
• Sequences of integers avoiding 3-term arithmetic progressions (Q426786) (← links)
• A new proof of the density Hales-Jewett theorem (Q431641) (← links)
• The joints problem for matroids (Q482235) (← links)
• The Green-Tao theorem: an exposition (Q489922) (← links)
• The NOF multiparty communication complexity of composed functions (Q496305) (← links)
• Enumerating solution-free sets in the integers (Q509275) (← links)
• On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression (Q509700) (← links)
• On the density of a graph and its blowup (Q602726) (← links)
• A new proof of the graph removal lemma (Q640795) (← links)
• On Roth's theorem on progressions (Q640798) (← links)
• More Turán-type theorems for triangles in convex point sets (Q668054) (← links)
• Maximal subsets free of arithmetic progressions in arbitrary sets (Q679856) (← links)
• More distinct distances under local conditions (Q722329) (← links)
• A generalization of sets without long arithmetic progressions based on Szekeres algorithm (Q740905) (← links)
• Trigonometric series with gaps (Q796571) (← links)
• Multiple recurrence and convergence results associated to \(\mathbb F_P^\omega\)-actions (Q891357) (← links)
• Injective colorings with arithmetic constraints (Q897262) (← links)
• Novel structures in Stanley sequences (Q898128) (← links)
• Matrix multiplication via arithmetic progressions (Q915378) (← links)
• Finding large 3-free sets. I. The small \(n\) case (Q927879) (← links)
• On subsets of \(\mathbb F_q^n\) containing no \(k\)-term progressions (Q976161) (← links)
• On distinct distances and \(\lambda \)-free point sets (Q998391) (← links)
• Arithmetic progressions in sets of fractional dimension (Q1034679) (← links)
• On distinct distances among points in general position and other related problems (Q1046803) (← links)
• On the diagonal queens domination problem (Q1073797) (← links)
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent (Q1076037) (← links)
• On some metric and combinatorial geometric problems (Q1077726) (← links)
• On the Erdős-Straus non-averaging set problem (Q1085205) (← links)
• On subsets of abelian groups with no 3-term arithmetic progression (Q1088718) (← links)
• Parallelepipeds in sets of integers (Q1090707) (← links)
• On the combinatorial problems which I would most like to see solved (Q1164626) (← links)
• Chessboard domination problems (Q1174120) (← links)
• Fast rectangular matrix multiplication and applications (Q1271174) (← links)
• Non-averaging subsets and non-vanishing transversals (Q1284465) (← links)
• Greedy algorithm, arithmetic progressions, subset sums and divisibility (Q1301639) (← links)
• Multiple recurrence of Markov shifts and other infinite measure preserving transformations (Q1567348) (← links)
• Quantitative multiple recurrence for two and three transformations (Q1670335) (← links)
• Nonlinear Roth type theorems in finite fields (Q1678498) (← links)
• Arithmetic progressions in multiplicative groups of finite fields (Q1686398) (← links)
• Threshold functions and Poisson convergence for systems of equations in random sets (Q1706093) (← links)
• Large sets avoiding patterns (Q1747202) (← links)
• On generalized Stanley sequences (Q1747975) (← links)
• Erdős-Ginzburg-Ziv constants by avoiding three-term arithmetic progressions (Q1753088) (← links)