MS-E1603 - Random Graphs and Network Statistics D, Lecture, 13.9.2021-21.10.2021
This course space end date is set to 21.10.2021 Search Courses: MS-E1603
Lollipops and critical subgraph thresholds (10 min)
Completion requirements
View
Lollipops provide a famous counterexample for which the expected subgraph count can be large in a Bernoulli graph which does not contain any such lollipops with high probability.
MP4
Video Player is loading.
This is a modal window.
The media could not be loaded, either because the server or network failed or because the format is not supported.