Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, September 29, 2015, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Jan Volec

Rainbow triangles in 3-edge-colored graphs

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.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login