Év szerint Hónap szerint Ugrás a hónaphoz

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

iCal fájl letöltése
Péntek, 3. Május 2019, 11:00 - 13:00

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 t-edge 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 "in-between" as well.

Several of the results are joint with András Gyárfás and/or Endre Szemerédi.
Hely : Bolyai Intézet, I. emelet, Riesz terem, Aradi Vértanúk tere 1., Szeged


JEvents v3.1.8 Stable   Copyright © 2006-2013