printable pdf
比利时vs摩洛哥足彩
,
比利时vs摩洛哥足彩
,
university of california san diego
****************************
math 269 - combinatorics
prof. michael molloy
university of toronto
k-regular subgraphs near the k-core threshold of a random graph
abstract:
we prove that $g_{n,p=c/n}$ whp has a $k$-regular subgraph if $c$ is at least $e^{-\theta(k)}$ above the threshold for the appearance of a subgraph with minimum degree at least $k$; i.e. an non-empty $k$-core. in particular, this pins down the threshold for the appearance of a $k$-regular subgraph to a window of size $e^{-\theta(k)}$.
this is a joint work with dieter mitsche and pawel pralat; see arxiv:1804.04173
february 6, 2024
2:00 pm
apm 7321
research areas
combinatorics****************************
