Publications

Search
Author Title Type [ Year(Asc)]
2014
Gao, Pu . 2014. “The First K-Regular Subgraph Is Large”. Combinatorics, Probability And Computing 23: 412–433.
Gao, Pu . 2014. “Uniform Generation Of D-Factors In Dense Host Graphs”. Graphs And Combinatorics 30: 581–589.
Gao, Pu , Xavier Pérez-Giménez, and Cristiane M Sato. 2014. “Arboricity And Spanning-Tree Packing In Random Graphs With An Application To Load Balancing”. In Proceedings Of The Twenty-Fifth Annual Acm-Siam Symposium On Discrete Algorithms, 317–326. Society for Industrial and Applied Mathematics.
Ebrahimzadeh, Ehsan , Linda Farczadi, Pu Gao, Abbas Mehrabian, Cristiane M Sato, Nick Wormald, and Jonathan Zung. 2014. “On Longest Paths And Diameter In Random Apollonian Networks”. Random Structures & Algorithms 45: 703–725.
2013
Farczadi, L , K Georgiou, J Koenemann, E Ehsan, P Gao, A Mehrabian, CM Sato, N Wormald, J Zung, and L Devroye. 2013. “Linda Farczadi Www. Math. Uwaterloo. Ca/ Lfarczad”. Discrete Mathematics & Theoretical Computer Science 15: 71–86.
Ebrahimzadeh, Ehsan , Linda Farczadi, Pu Gao, Abbas Mehrabian, Cristiane M Sato, Nick Wormald, and Jonathan Zung. 2013. “On The Longest Paths And The Diameter In Random Apollonian Networks”. Electronic Notes In Discrete Mathematics 43: 355–365.
Gao, Pu , and Michael Molloy. 2013. “Inside The Clustering Threshold For Random Linear Equations”. Arxiv Preprint Arxiv:1309.6651.
Cibulka, Josef , Pu Gao, Marek Krčál, Tomáš Valla, and Pavel Valtr. 2013. “Polynomial Bounds On Geometric Ramsey Numbers Of Ladder Graphs”. In The Seventh European Conference On Combinatorics, Graph Theory And Applications, 171–176. Edizioni della Normale, Pisa.
Gao, Pu . 2013. “Distribution Of The Number Of Spanning Regular Subgraphs In Random Graphs”. Random Structures & Algorithms 43: 338–353.
Gao, Pu . 2013. “Distributions Of Sparse Spanning Subgraphs In Random Graphs”. Siam Journal On Discrete Mathematics 27: 386–401.
2012
Gao, Pu , Yi Su, and Nicholas Wormald. 2012. “Induced Subgraphs In Sparse Random Graphs With Given Degree Sequences”. European Journal Of Combinatorics 33: 1142–1166.
2010
Gao, Pu . 2010. “Connectivity Of Random Regular Graphs Generated By The Pegging Algorithm”. Journal Of Graph Theory 65: 185–197.
Gao, Pu , and Nicholas C Wormald. 2010. “Load Balancing And Orientability Thresholds For Random Hypergraphs”. In Proceedings Of The Forty-Second Acm Symposium On Theory Of Computing, 97–104. ACM.
2009
Gao, Pu , and Nicholas Wormald. 2009. “Rate Of Convergence Of The Short Cycle Distribution In Random Regular Graphs Generated By Pegging”. The Electronic Journal Of Combinatorics 16: 44.
Gao, Pu , and Nicholas Wormald. 2009. “Short Cycle Distribution In Random Regular Graphs Recursively Generated By Pegging”. Random Structures & Algorithms 34: 54–86.
2006

Pages