







See by year  See by month  Jump to month  

Sárközy Gábor (Rényi Intézet): Monochromatic covers in edgecolored graphs and hypergraphs 



Friday, 3. May 2019, 11:00  13:00


Abstract. We survey some results on the following general problem: Say we are given fixed positive integers s, t and a family of graphs F. Minimizing over all tedge colorings of the complete graph on n vertices, we ask for the maximum number of vertices that can be covered by at most s monochromatic members of F. This problem unites two classical problems: at one end of the spectrum (s = 1) we have the Ramsey problem, while at the other end we have cover problems. But there are some interesting problems "inbetween" as well.
Several of the results are joint with András Gyárfás and/or Endre Szemerédi. 
Location : Bolyai Intézet, I. emelet, Riesz terem, Aradi Vértanúk tere 1., Szeged 
Back
JEvents v3.1.8 Stable
Copyright © 20062013