A remark concerning arithmetic progressions

DOI10.1016/0097-3165(80)90035-7zbMATH Open0461.10045OpenAlexW2072075682MaRDI QIDQ1152407FDOQ1152407

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

• Title not available (Why is that?)
• Asymptotic lower bounds for Ramsey functions
• Title not available (Why is that?)
• A Construction for Partitions Which Avoid Long Arithmetic Progressions
• Title not available (Why is that?)

Cited In (10)

• 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
• Piecewise syndetic sets in \(\mathbb{N}^t\) and \(\mathbb{N}^X\)
• Monochromatic arithmetic progressions with large differences
• Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel
• Colorings of hypergraphs with large number of colors

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)