A Sparse Graham-Rothschild Theorem

DOI10.2307/2001162MaRDI QIDQ3812254zbMATH OpenOpenAlexFDO

Authors Hans Jürgen Prömel, Bernd Voigt

Publication date 1988

Published in Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2001162

zbMATH Keywords

arithmetic progressionsGraham-Rothschild theoremparameter sets

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Enumerative combinatorics (05A99) Generalized Ramsey theory (05C55) Other combinatorial number theory (11B75)

Recommendations

• Partitions of factorisations of parameter words
• An infinitary extension of the Graham–Rothschild Parameter Sets Theorem
• Sparse Ramsey graphs
• A density version of the Hales-Jewett theorem
• Factor-complement partitions of ascending \(k\)-parameter words

Cited in

(13)

• Induced partition properties of combinatorial cubes
• Independence for partition regular equations
• On colorings of variable words
• Roth's theorem for four variables and additive structures in sums of sparse sets
• On dual Ramsey theorems for relational structures
• scientific article; zbMATH DE number 3920524 (Why is no real title available?)
• scientific article; zbMATH DE number 15377 (Why is no real title available?)
• scientific article; zbMATH DE number 16107 (Why is no real title available?)
• Box and Segment Intersection Graphs with Large Girth and Chromatic Number
• Partitions of factorisations of parameter words
• Geometric Graphs with Exponential Chromatic Number and Arbitrary Girth
• A solution to Ringel's circle problem
• An extremal problem for Graham-Rothschild parameter words

This page was built for publication: A Sparse Graham-Rothschild Theorem

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