András Bezdek: On colored variants of some two-player games
Bezdek AndrásBBC+G Seminar
on 10/15/21
Two first-week exercises introducing Ramsey-type problems are:
1. In every 2-coloring of the edges of there is a monochromatic spanning tree.
2. In every 2-coloring of the edges of there is a monochromatic matching of size n.
We discuss how these statements change for vertex-ordered complete graphs where independent edges can be nested, crossing or separated. Results and problems are from a recent joint work with János Barát and Géza Tóth.