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, March 10, 2011, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Yury Person (FU Berlin)

(Hyper-)graph quasi-randomness

Quasi-randomness is a concept that studies deterministic objects that behave in many ways random objects do. It was first introduced by Thomason, and in their seminal paper Chung, Graham and Wilson considered several quasi-random graph properties that all turned out to be equivalent. I will discuss some of these properties, their possible generalizations to hypergraphs and consequences for the graph quasi-randomness.

Joint work with David Conlon, Hiep Han and Mathias Schacht.

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