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: Thursday, February 12, 2004, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Yoshio Okamoto

A solution to the Furedi-Hajnal conjecture by Marcus & Tardos

How many 1's can there be in an n by n 0/1-matrix which avoids a certain fixed 0/1-matrix? Such a problem is related to Zarankiewicz problem in Extremal graph theory, and to Davenport-Schinzel theory which plays a great role in discrete and computational geometry.
Furedi & Hajnal ('92) conjectured if a given 0/1-matrix is a permutation matrix then the number of 1's is linear in n. Recently, Marcus & Tardos proved the conjecture affirmative in a quite simple way. In this talk, we are going to look at their proof, some consequences, and open problems.

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