Kai-Nan Xiang

According to our database, Kai-Nan Xiang authored at least 7 papers between 2009 and 2020.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2020

An invariance principle and a large deviation principle for the biased random walk on ${\mathbb{Z}}^{\lowercase{\textbf{\textit{d}}}}$.

Yuelin Liu, Vladas Sidoravicius, Longmin Wang, Kai-Nan Xiang

J. Appl. Probab., 2020

2018

The largest component in critical random intersection graphs.

Bin Wang, Longmin Wang, Kai-Nan Xiang

Discuss. Math. Graph Theory, 2018

2012

Decomposition of 3-connected representable matroids.

Rong Chen, Kai-Nan Xiang

J. Comb. Theory, Ser. B, 2012

Polynomial algorithm for sharp upper bound of rainbow connection number of maximal outerplanar graphs.

Xingchao Deng, Kai-Nan Xiang, Baoyindureng Wu

Appl. Math. Lett., 2012

2010

Amalgams of extremal matroids with no U_{2, <i>l</i>+2}-minor.

Joseph E. Bonin, Rong Chen, Kai-Nan Xiang

Discret. Math., 2010

2009

A Note on Totally Free Matroids.

Rong Chen, Kai-Nan Xiang

Graphs Comb., 2009

On k-tuple domination of random graphs.

Bin Wang, Kai-Nan Xiang

Appl. Math. Lett., 2009