Two variants of the size Ramsey number

DOI10.7151/dmgt.1268zbMath1074.05062OpenAlexW1966321066MaRDI QIDQ5316268

Andrzej Ruciński, Andrzej Kurek

Publication date: 12 September 2005

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/2874c59ae7ff4cdf639350c182ddf9bd786152cf

zbMATH Keywords

graph densityonline Ramsey games

Mathematics Subject Classification ID

Games involving graphs (91A43) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items (20)

A note on on-line Ramsey numbers for quadrilaterals ⋮ Coloring number and on-line Ramsey theory for graphs and hypergraphs ⋮ On globally sparse Ramsey graphs ⋮ On-line Ramsey numbers for paths and short cycles ⋮ Online Ramsey theory for planar graphs ⋮ Bounds on Ramsey games via alterations ⋮ Restricted online Ramsey numbers of matchings and trees ⋮ On-line size Ramsey number for monotone \(k\)-uniform ordered paths with uniform looseness ⋮ Online Ramsey Numbers and the Subgraph Query Problem ⋮ On-line Ramsey numbers of paths and cycles ⋮ Unnamed Item ⋮ Short Proofs of Some Extremal Results ⋮ Online Ramsey games for more than two colors ⋮ Hypergraph Ramsey numbers ⋮ A note on restricted online Ramsey numbers of matchings ⋮ A note on on-line Ramsey numbers of stars and paths ⋮ An upper bound for the restricted online Ramsey number ⋮ A strengthening of the Erdős-Szekeres theorem ⋮ Coloring random graphs online without creating monochromatic subgraphs ⋮ Minimal ordered Ramsey graphs

This page was built for publication: Two variants of the size Ramsey number