2 problems

0 votes0 replies0 views
The unique giant component conjecture for random hypergraphs
Unique largest component conjecture. A unique largest component of size $\Omega(\varepsilon n^j)$ should exist with high probability whenever
Conjectureopencomponent-structure random-graphs random-hypergraphsarXiv posted 2 days ago
0 votes0 replies0 views
Threshold conjecture for bounded second-largest components in random chord diagrams
Let $m=m(n)$ be the number of crossings in a uniformly random chord diagram on $2n$ vertices, and let the second largest component mean the component with the second greatest numbe…
Conjectureopenchord-diagrams component-structure random-graphsarXiv posted 2 days ago

The unique giant component conjecture for random hypergraphs