Skip to main content

All Questions

Filter by
Sorted by
Tagged with
10 votes
0 answers
222 views

Asymptotics of subgraph densities in graphons

In Pittel (1989)'s solution to a problem of Knuth (1976) on the expected number of stable matchings between $n$ men and $n$ women under uniform random preferences, it was shown that, as $n \to \infty$,...
Yufei Zhao's user avatar
6 votes
2 answers
266 views

Lovasz local lemma for the edge model

In order to successfully apply the Lovasz local lemma, one needs the events to be relatively independent. This (sometimes) works well in the $G(n,p)$ model of random graphs, where the presence or ...
Vince Vatter's user avatar
  • 2,339