Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Talks by Michael Krivelevich

2001

September

• September 11, 2001, Michael Krivelevich (Tel Aviv University): Deciding k-colorability in expected polynomial time [details]

2003

February

• February 11, 2003, Michael Krivelevich (Tel Aviv University): Turan Numbers of Bipartite Graphs and Related Questions [details]

October

• October 14, 2003, Michael Krivelevich (Tel Aviv University): List Coloring of Graphs [details]

2004

November

• November 09, 2004, Michael Krivelevich (Tel Aviv Univ.): Sphere packing in Rⁿ through Graph Theory [details]

2005

September

• Wednesday, September 21, 2005, Michael Krivelevich (Tel Aviv Univ.): Property testing in graphs of general density [details]

2006

• September 19, 2006, Michael Krivelevich (Tel Aviv University): Packing Hamilton cycles in random graphs [details]

2007

October

• October 02, 2007, Michael Krivelevich (Tel Aviv Univ.): Avoiding small subgraphs in Achlioptas processes [details]

2008

• October 16, 2008, Michael Krivelevich (Tel Aviv Univ.): Perfectly balanced partitions of smoothed graphs [details]

2014

• October 21, 2014, Michael Krivelevich (Tel Aviv University): Contagious sets in random graphs [details]

2018

April

• April 26, 2018, Michael Krivelevich (Tel Aviv University): Getting a prescribed number of edges in a subgraph is polynomially unlikely [details]

2021

• April 27, 2021, in Zoom: conference room, Michael Krivelevich (Tel Aviv University): Linearly sized induced odd subgraphs [details]

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