Multicolor on-line degree Ramsey numbers of trees

DOI10.4310/JOC.2012.V3.N1.A4MaRDI QIDQ353401zbMATH OpenFDO

Authors William B. Kinnersley, Douglas B. West

Publication date 12 July 2013

Published in Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

treesRamsey numbersdegreeon-line coloring

Mathematics Subject Classification ID

Trees (05C05) Generalized Ramsey theory (05C55) Games on graphs (graph-theoretic aspects) (05C57)

Recommendations

• On-line Ramsey theory for bounded degree graphs
• Trees with an on-line degree Ramsey number of four
• Degree Ramsey numbers of graphs
• On-line Ramsey numbers for paths and stars
• Some degree Ramsey numbers

Cited in

(6)

• Trees with an on-line degree Ramsey number of four
• On-line size Ramsey number for monotone \(k\)-uniform ordered paths with uniform looseness
• A strengthening of the Erdős-Szekeres theorem
• Some degree Ramsey numbers
• The on-line degree Ramsey number of cycles
• Degree Ramsey numbers of graphs

This page was built for publication: Multicolor on-line degree Ramsey numbers of trees

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