Gao Pu

activity

20102026

most citedAnalysis of the parallel peeling algorithm: a short proof

8 citations · 39 across the 17 of their papers we have counts for

collaborators

Showing 2020Show all

2 papers · 1 filter

math.CO2020★ 2 cited

Kim--Vu's sandwich conjecture is true for $d ≫ lo g^{4} n$

Pu Gao, Mikhail Isaev, Brendan McKay

Kim and Vu made the following conjecture (\textit{Advances in Mathematics}, 2004): if $d ≫ lo g n$ , then the random $d$ -regular graph $G (n, d)$ can be ``sandwiched'' between $G(n,p…

math.CO2020★ 3 cited

Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity

Pu Gao, Yuval Ohapkin

Given a graphical degree sequence $d = (d_{1}, \dots, d_{n})$ , let $G (n, d)$ denote a uniformly random graph on vertex set $[n]$ where vertex $i$ has degree $d_{i}$ for every…

Kim--Vu's sandwich conjecture is true for d≫log4n

Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity

Kim--Vu's sandwich conjecture is true for $d ≫ lo g^{4} n$