2 problems

Logarithmic largest component conjecture for subcritical dynamic random graphs
arXiv@arxiv
Let $G_n$ be the dynamic random graph with vertex removal studied in the paper, and let $\mathcal C_1$ denote its largest component. The parameter $\beta$ is in the subcritical reg…
Conjectureopendynamic-graphs probability random-graphs
0
Triangle Conjecture
arXiv@arxiv
Consider the word-RAM model of computation with word length $O(\log b)$ for inputs of length $b$ . An undirected graph $G$ has $m$ edges. Triangle Conjecture. There exists a constan…
Conjectureopendynamic-graphs fine-grained-complexity graph-algorithms
0

Logarithmic largest component conjecture for subcritical dynamic random graphs