Trees with an on-line degree Ramsey number of four

MaRDI QIDQ640428zbMATH OpenFDO

Authors David Rolnick

Publication date 18 October 2011

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

Full work available at URL http://www.emis.de/journals/EJC/Volume_18/Abstracts/v18i1p173.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

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

Recommendations

• The on-line degree Ramsey number of cycles
• On-line Ramsey theory for bounded degree graphs
• Multicolor on-line degree Ramsey numbers of trees
• On-line Ramsey numbers for paths and stars
• On-line Ramsey Numbers

Cited in

(5)

• On-line size Ramsey number for monotone \(k\)-uniform ordered paths with uniform looseness
• Multicolor on-line degree Ramsey numbers of trees
• On-line Ramsey theory for bounded degree graphs
• On the computational complexity and strategies of online Ramsey theory
• The on-line degree Ramsey number of cycles

This page was built for publication: Trees with an on-line degree Ramsey number of four

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