The following pages link to (Q3575431):
Displaying 24 items.
- Bounds on the game transversal number in hypergraphs (Q326647) (← links)
- Online Ramsey theory for planar graphs (Q405170) (← links)
- On-line Ramsey numbers of paths and cycles (Q490318) (← links)
- Proper colouring painter-builder game (Q1690226) (← links)
- A note on restricted online Ramsey numbers of matchings (Q2048542) (← links)
- A note on on-line Ramsey numbers of stars and paths (Q2049035) (← links)
- A strengthening of the Erdős-Szekeres theorem (Q2065993) (← links)
- On-line Ramsey numbers for paths and short cycles (Q2185753) (← links)
- On-line size Ramsey number for monotone \(k\)-uniform ordered paths with uniform looseness (Q2225445) (← links)
- On induced online Ramsey number of paths, cycles, and trees (Q2330552) (← links)
- Transversal game on hypergraphs and the \(\frac{3}{4}\)-conjecture on the total domination game (Q2821619) (← links)
- On-line Ramsey Numbers (Q3058538) (← links)
- (Q3120651) (← links)
- A note on on-line Ramsey numbers for quadrilaterals (Q3458969) (← links)
- Domination Game: A proof of the $3/5$-Conjecture for Graphs with Minimum Degree at Least Two (Q3462542) (← links)
- Paired-Domination Game Played in Graphs (Q5242939) (← links)
- (Q5449142) (← links)
- Coloring random graphs online without creating monochromatic subgraphs (Q5495876) (← links)
- Off-diagonal online size Ramsey numbers for paths (Q6201874) (← links)
- Online size Ramsey numbers: path vs \(C_4\) (Q6611748) (← links)
- The asymptotic of off-diagonal online Ramsey numbers for paths (Q6612302) (← links)
- Online size Ramsey numbers: odd cycles vs connected graphs (Q6614169) (← links)
- Online Ramsey numbers: long versus short cycles (Q6654127) (← links)
- Online Ramsey numbers of ordered paths and cycles (Q6671611) (← links)
