Quantitative versions of combinatorial partition theorems.

MaRDI QIDQ1814077zbMATH OpenFDO

Authors Ron Graham, Peter Frankl, Vojtěch Rödl

Publication date 25 June 1992

Published in Jahresbericht der Deutschen Mathematiker-Vereinigung (DMV) (Search for Journal in Brave)

zbMATH Keywords

partition theorems

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Generalized Ramsey theory (05C55) Elementary theory of partitions (11P81)

Recommendations

• A Generalization of the Classical Partition Theorems
• Certain partition theorems.
• Asymptotically Sufficient Partitions and Quantizations
• The enumerative properties of combinatorial partition polynomials
• Combinatorics and \(n\)-color perfect partitions.
• Combinatorics and complexity of partition functions

Cited in

(5)

• Finite sums of arithmetic progressions
• Monochromatic permutation quadruples. A Schur thing in \(S_{n}\)
• Tverberg partitions and Borsuk-Ulam theorems.
• scientific article; zbMATH DE number 5053296 (Why is no real title available?)
• On an extension of a theorem of Schur

This page was built for publication: Quantitative versions of combinatorial partition theorems.

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