Pu Gao

activity

20102023

most citedCounting triangles in power-law uniform random graphs

10 citations · 39 across the 21 of their papers we have counts for

collaborators

Showing math.COShow all

21 papers · 1 filter

math.CO2023

Minors of matroids represented by sparse random matrices over finite fields

Pu Gao, Peter Nelson

Consider a random $n \times m$ matrix $A$ over the finite field of order $q$ where every column has precisely $k$ nonzero elements, and let $M [A]$ be the matroid represented by $A$ .…

math.CO2022

A Fully Adaptive Strategy for Hamiltonian Cycles in the Semi-Random Graph Process

Pu Gao, Calum MacRury, Pawel Pralat

The semi-random graph process is a single player game in which the player is initially presented an empty graph on $n$ vertices. In each round, a vertex $u$ is presented to the pla…

math.CO2021★ 2 cited

Perfect Matchings in the Semi-random Graph Process

Pu Gao, Calum MacRury, Pawel Pralat

The semi-random graph process is a single player game in which the player is initially presented an empty graph on $n$ vertices. In each round, a vertex $u$ is presented to the pla…

math.CO2020★ 1 cited

Triangles and subgraph probabilities in random regular graphs

Pu Gao

We improve the estimates of the subgraph probabilities in a random regular graph. Using the improved results, we further improve the limiting distribution of the number of triangle…

math.CO2020★ 3 cited

Hamilton Cycles in the Semi-random Graph Process

Pu Gao, Bogumil Kaminski, Calum MacRury +1

The semi-random graph process is a single player game in which the player is initially presented an empty graph on $n$ vertices. In each round, a vertex $u$ is presented to the pla…

math.CO2020

The threshold of symmetry in random graphs with specified degree sequences

Lochlan Brick, Pu Gao, Angus Southwell

We give sufficient conditions under which a random graph with a specified degree sequence is symmetric or asymmetric. In the case of bounded degree sequences, our characterisation…