A remark concerning arithmetic progressions

DOI10.1016/0097-3165(80)90035-7MaRDI QIDQ1152407zbMATH OpenOpenAlexFDO

Authors József Beck

Publication date 1980

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0097-3165(80)90035-7

zbMATH Keywords

compactness principle

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Arithmetic progressions (11B25)

Cites work

• scientific article; zbMATH DE number 3675980 (Why is no real title available?)
• scientific article; zbMATH DE number 3685495 (Why is no real title available?)
• scientific article; zbMATH DE number 3492718 (Why is no real title available?)
• A Construction for Partitions Which Avoid Long Arithmetic Progressions
• Asymptotic lower bounds for Ramsey functions

Cited in

(10)

• Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel
• Colorings of hypergraphs with large number of colors
• Coloring hypergraphs with bounded cardinalities of edge intersections
• An application of Lovász' local lemma-A new lower bound for the van der Waerden number
• Multipass greedy coloring of simple uniform hypergraphs
• Extremal problems in hypergraph colourings
• Coloring uniform hypergraphs with few edges
• Improved algorithms for colorings of simple hypergraphs and applications
• Monochromatic arithmetic progressions with large differences
• Piecewise syndetic sets in \(\mathbb{N}^t\) and \(\mathbb{N}^X\)

This page was built for publication: A remark concerning arithmetic progressions

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