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

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar Talk Information |

**Date and Time**: Tuesday, December 09, 2014, 12:15 pm

**Duration**: 30 minutes

**Location**: CAB G51

**Speaker**: Roman Glebov

We show that for every epsilon > 0 there exist delta > 0 and natural number n_0 such that every 3-uniform hypergraph on n >= n_0 vertices with the property that every k-vertex subset, where k is at least delta*n, induces at least (1/4 + epsilon)*(k choose 3) edges, contains K4- as a subgraph, where K4- is the 3-uniform hypergraph on 4 vertices with 3 edges. This question was originally raised by Erdős and Sós. The constant 1/4 is the best possible.

This is a joint work with Dan Kral and Jan Volec.

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

Previous talks by year: 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