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

__Mittagsseminar Talk Information__ | |

**Date and Time**: Thursday, April 26, 2018, 12:15 pm

**Duration**: 30 minutes

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

**Speaker**: Michael Krivelevich (Tel Aviv University)

## Getting a prescribed number of edges in a subgraph is polynomially unlikely

Let k, l be positive integers with 0 ≤ l ≤ \binom{k}{2}, and let G be a graph of n vertices, for n ≫ k,l. How many k-subsets of G span exactly l edges? In other words, what is the probability that a random k-subset of V(G) spans exactly l edges? This probability can obviously be 1 for l=0, and is easily seen to be possibly as high as an absolute constant for some values of l linear in k. However, we show that for the values of l quadratically in k away from the boundaries 0,\binom{k}{2}, the probability in question is polynomially small in k.

A joint work with Noga Alon, Dan Hefetz and Mykhaylo Tyomkyn.

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