Monochromatic vs multicolored paths

DOI10.1007/BF02351589MaRDI QIDQ1205343zbMATH OpenOpenAlexFDO

Authors Hanno Lefmann, Vojtěch Rödl, Robin Thomas

Publication date 1 April 1993

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02351589

zbMATH Keywords

Ramsey theoremmonotone subsequencesinfinite colour set

Mathematics Subject Classification ID

Ramsey theory (05D10)

Recommendations

• scientific article; zbMATH DE number 398964
• New upper bounds for a canonical Ramsey problem
• Monochromatic infinite paths
• On canonical Ramsey numbers for complete graphs versus paths

Cites work

• scientific article; zbMATH DE number 3257176 (Why is no real title available?)
• scientific article; zbMATH DE number 4185671 (Why is no real title available?)
• scientific article; zbMATH DE number 3019031 (Why is no real title available?)
• A Combinatorial Theorem

Cited in

(9)

• Ascending waves
• In memoriam: Professor Robin Thomas (1962--2020)
• New upper bounds for a canonical Ramsey problem
• A note on a Ramsey-type problem for sequences
• Flashes and rainbows in tournaments
• Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs.
• Ramsey-Sperner theory
• Ordered and canonical Ramsey numbers of stars
• Coloring mixed hypertrees

This page was built for publication: Monochromatic vs multicolored paths

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