Tel Aviv University - Horowitz Seminar
      Dear all,
      This week at the Horowitz seminar on Probability, Ergodic
      Theory and Dynamical Systems at Tel Aviv University we
      will have a longer seminar, from 14:30 to 16:00 (or
      ending a little earlier). We are happy to have:
Speaker: Michael Krivelevich, Tel Aviv University
Title: Random subgraphs of large minimum degree graphs
Date: Monday, October 29
Time: 14:30 UNTIL 16:00! (or ending a little earlier)
Place: Schreiber 309
Consider the following very general model of random graphs: let
G be a finite graph of minimum degree at least k, for k tending
to infinity, and form a random subgraph G_p of G by taking each
edge of G with probability p=p(k), independently. What can be
said about typical properties of such random graph? This model
covers a lot of ground, including binomial random graphs
G(k+1,p), random subgraphs of the k-dimensional binary cube
Q^k, random subgraphs of k-regular expanders etc. Generality
has its price, and some classical questions from the theory of
random graphs (appearance of a fixed subgraph, chromatic number
etc.) become irrelevant, while some others are probably just
too hard. Still, there is quite a number of attractive problems
that appear to be approachable. In this talk, I will report
about our recent results on some of them.
Based on joint works with (subsets of) Alan Frieze, Choongbum
Lee, Benny Sudakov.
Best regards,
Seminar webpage:
Technion Math Net-2 (TECHMATH2)
Editor: Michael Cwikel   <> 
Announcement from: Ron Peled   <>