X. Cai

activity

20132021

most citedA Probabilistic Analysis of Kademlia Networks

8 citations · 54 across the 13 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2018

Non-fringe subtrees in conditioned Galton--Watson trees

Xing Shi Cai, Svante Janson

We study $S (T_{n})$ , the number of subtrees in a conditioned Galton--Watson tree of size $n$ . With two very different methods, we show that $lo g (S (T_{n}))$ has a…

math.CO2014★ 4 cited

Acyclic edge colourings of graphs with large girth

Xing Shi Cai, Guillem Perarnau, Bruce Reed +1

An edge colouring of a graph $G$ is called acyclic if it is proper and every cycle contains at least three colours. We show that for every $ε > 0$ , there exists a $g=g(\var…