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, June 05, 2018, 12:15 pm

**Duration**: 30 minutes

**Location**: OAT S15/S16/S17

**Speaker**: Charlotte Knierim

In 1963 Corrádi and Hanjal showed that every graph G with minimum degree δ(G)≥ (2/3)n has a triangle factor. Balogh, Lee and Samotij transferred this result to the setting of the random graph G(n,p) and showed that, provided p>> (log n/n)^{1/2}, for a subgraph G ⊆ Γ~ G(n,p) a minimum degree of δ(G)≥(2/3+o(1))np suffices to cover all but O(p^{-2}) vertices in G with disjoint triangles.

We use an idea of Fischer, Škorić, Steger and Trujić and replace the degree condition in the previous result by a lower bound on the number of triangles each vertex is in. We show that in this case for every α > 0 we find a triangle factor provided ((log n)/p)^{1/2} < < p < < n^{-\alpha}.

This masterthesis was supervised by Angelika Steger and Miloš Trujić.

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