Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, December 21, 2006, 12:15 pm
Duration: This information is not available in the database
Location: CAB G51
Speaker: Tibor Szabó
No attendance of Part I is needed to follow this talk, everything will be kept self-contained.
A p-coloring of the edges of the n-dimensional hypercube graph Q_n is called d-polychromatic if all p colors are used in all the d-dimensional subcubes of Q_n. For example all edges receiving the same color defines a polychromatic coloring in 1 color. Naturally, we are interested in using as many colors as possible in a polychromatic coloring.
This problem was raised in a joint paper with Noga Alon and Anja Krech (in relation to Turan-type problems within the hypercube) and was solved recently by David Offner who is a graduate student at Carnegie Mellon University. In the talk we hope to fully explain his solution.
Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)
Previous talks by year: 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