Estimating multicolor ordered Ramsey numbers

DOI10.1016/J.DISC.2026.115286MaRDI QIDQ7314032zbMATH OpenFDO

Authors Martin Balko, Klára Grinerová

Publication date 13 August 2026

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2026.115286

Mathematics Subject Classification ID

Trees (05C05) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Cites work

• A combinatorial problem in geometry.
• A new upper bound for diagonal Ramsey numbers
• A note on Ramsey numbers
• An improved lower bound for multicolor Ramsey numbers and a problem of Erdős
• An improved lower bound on multicolor Ramsey numbers
• Dedekind's problem in the hypergrid
• scientific article; zbMATH DE number 3724497 (Why is no real title available?)
• scientific article; zbMATH DE number 3893206 (Why is no real title available?)
• Lower bounds for multicolor Ramsey numbers
• Off-diagonal hypergraph Ramsey numbers
• Off-diagonal ordered Ramsey numbers of matchings
• On ordered Ramsey numbers of bounded-degree graphs
• On ordered Ramsey numbers of matchings versus triangles
• Ordered Ramsey numbers
• Ramsey numbers and monotone colorings
• Ramsey numbers of degenerate graphs
• Ramsey numbers of ordered graphs
• Ramsey problems for monotone paths in graphs and hypergraphs
• Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem
• Sharp bounds for some multicolour Ramsey numbers
• Some remarks on the theory of graphs
• The probabilistic method
• The Ramsey number of a graph with bounded maximum degree
• Upper bounds for multicolour Ramsey numbers

This page was built for publication: Estimating multicolor ordered Ramsey numbers

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