A Construction for Partitions Which Avoid Long Arithmetic Progressions

DOI10.4153/CMB-1968-047-7MaRDI QIDQ5556460zbMATH OpenWikidataFDO

Authors Elwyn R. Berlekamp

Publication date 1968

Published in Canadian Mathematical Bulletin (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/CMB-1968-047-7

zbMATH Keywords

combinatorics

Cited in

(35)

• Van der Waerden and Ramsey type games
• Large minimal sets which force arithmetic progressions
• A remark concerning arithmetic progressions
• Ramsey functions related to the van der Waerden numbers
• Progressions in sequences of nearly consecutive integers
• A pseudo upper bound for the van der Waerden function
• A new lower bound for van der Waerden numbers
• Random strategies are nearly optimal for generalized van der Waerden games
• On partitioning integers into progression free sets
• A subexponential upper bound for van der Waerden numbers \(W(3,k)\)
• Arithmetic progressions, quasi progressions, and Gallai-Ramsey colorings
• Another note on intervals in the Hales-Jewett theorem
• A lower bound for off-diagonal van der Waerden numbers
• An upper bound for van der Waerden-like numbers using \(k\) colors
• Monochromatic Hilbert cubes and arithmetic progressions
• Lower bounds for certain types of van der Waerden numbers
• An Upper Bound for the Hales--Jewett Number $\mathrm{HJ}(4,2)$
• An application of Lovász' local lemma-A new lower bound for the van der Waerden number
• Multipass greedy coloring of simple uniform hypergraphs
• Arithmetic Progressions and Tic-Tac-Toe Games
• On the lower bound for the van der Waerden function
• Primitive Recursive Bounds for Van Der Waerden Numbers
• Van der Waerden function and colorings of hypergraphs with large girth
• Monochromatic progressions in random colorings
• Colourings of uniform hypergraphs with large girth and applications
• Extremal problems in hypergraph colourings
• A blurred view of Van der Waerden type theorems
• Compression using efficient multicasting
• New lower bounds for van der Waerden numbers using distributed computing
• Lower bounds for multicolor van der Waerden numbers
• Some new van der Waerden numbers
• Some new bounds and values for van der Waerden-like numbers
• Improved algorithms for colorings of simple hypergraphs and applications
• Bounds on some van der Waerden numbers
• Using the incompressibility method to obtain local Lemma results for Ramsey-type problems

This page was built for publication: A Construction for Partitions Which Avoid Long Arithmetic Progressions

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