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, August 16, 2012, 12:15 pm

Duration: 30 minutes

Location: HG D5.2

Speaker: Otfried Cheong (Korea Advanced Institute of Science and Technology (KAIST), South Korea)

Fan-Crossing Free Graphs and other edge crossing properties

A graph embedded in the plane has a fan crossing if some edge crosses two edges that share an endpoint. We prove that a graph without fan crossings on n vertices has at most 4n-8 edges, and give generalizations to various other forbidden patterns for the set of edges crossed by an edge.

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