MS-E1603 - Random Graphs and Network Statistics D, 07.09.2020-15.10.2020
This course space end date is set to 15.10.2020 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