Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, September 29, 2015, 12:15 pm
Duration: 30 minutes
Location: OAT S15/S16/S17
Speaker: Jan Volec
We show that the maximum number of rainbow triangles in large 3-edge-colored graphs is attained by the following construction: take a blow-up of the properly 3-edge-colored complete graph on four vertices, where the sizes of every two blobs differ by at most 1, and inside every blob place an extremal construction on the corresponding number of vertices. In particular, this implies that the maximum density of rainbow triangles in 3-edge-colored graphs is asymptotically equal to 2/5. This question was originally raised by Erdos and Sos. Joint work with Jozef Balogh, Ping Hu, Bernard Lidicky, Florian Pfender, and Michael Young.
Automatic MiSe System Software Version 1.4803M | admin login