The following pages link to Pu Gao (Q427799):
Displaying 45 items.
- Induced subgraphs in sparse random graphs with given degree sequences (Q427801) (← links)
- On the geometric Ramsey numbers of trees (Q501079) (← links)
- Counting triangles in power-law uniform random graphs (Q785565) (← links)
- Enumeration of graphs with a heavy-tailed degree sequence (Q895547) (← links)
- A transition of limiting distributions of large matchings in random graphs (Q895995) (← links)
- Rate of convergence of the short cycle distribution in random regular graphs generated by pegging (Q1028821) (← links)
- The satisfiability threshold for random linear equations (Q2003764) (← links)
- Uniform generation of \(d\)-factors in dense host graphs (Q2014710) (← links)
- Sandwiching dense random regular graphs between binomial random graphs (Q2089753) (← links)
- Hamilton cycles in the semi-random graph process (Q2237858) (← links)
- On the geometric Ramsey number of outerplanar graphs (Q2256584) (← links)
- Uniform generation of spanning regular subgraphs of a dense graph (Q2335698) (← links)
- Mixing time of the switch Markov chain and stable degree sequences (Q2659068) (← links)
- Global stability to steady supersonic flows with mass addition in one-dimensional duct (Q2701291) (← links)
- Distribution of the number of spanning regular subgraphs in random graphs (Q2856578) (← links)
- Load balancing and orientability thresholds for random hypergraphs (Q2875136) (← links)
- Connectivity of random regular graphs generated by the pegging algorithm (Q3069674) (← links)
- Sandwiching a densest subgraph by consecutive cores (Q3192385) (← links)
- Short cycle distribution in random regular graphs recursively generated by pegging (Q3608313) (← links)
- Uniform generation of random graphs with power-law degree sequences (Q4608003) (← links)
- Arboricity and spanning‐tree packing in random graphs (Q4642744) (← links)
- Uniform Generation of Random Regular Graphs (Q4978195) (← links)
- Hamiltonicity of Random Graphs in the Stochastic Block Model (Q5009335) (← links)
- The rank of sparse random matrices (Q5146801) (← links)
- Sandwiching random regular graphs between binomial random graphs (Q5146810) (← links)
- On longest paths and diameter in random apollonian networks (Q5256390) (← links)
- Distributions of Sparse Spanning Subgraphs in Random Graphs (Q5300501) (← links)
- Orientability Thresholds for Random Hypergraphs (Q5364256) (← links)
- Arboricity and spanning-tree packing in random graphs with an application to load balancing (Q5383982) (← links)
- The First<i>k</i>-Regular Subgraph is Large (Q5418809) (← links)
- (Q5419961) (← links)
- The Stripping Process Can be Slow: Part II (Q5745126) (← links)
- Perfect Matchings in the Semirandom Graph Process (Q5864217) (← links)
- The Threshold of Symmetry in Random Graphs with Specified Degree Sequences (Q5883276) (← links)
- Full rainbow matchings in graphs and hypergraphs (Q5886109) (← links)
- A new enabling variational inference model for approximating measurement likelihood in filtering nonlinear system (Q6061010) (← links)
- Fast uniform generation of random graphs with given degree sequences (Q6074660) (← links)
- Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity (Q6076216) (← links)
- The number of perfect matchings, and the nesting properties, of random regular graphs (Q6076217) (← links)
- The rank of sparse random matrices (Q6077051) (← links)
- Correction to: ``Sandwiching dense random regular graphs between binomial random graphs'' (Q6095845) (← links)
- Minors of matroids represented by sparse random matrices over finite fields (Q6512208) (← links)
- Evolution of random representable matroids: minors, circuits, connectivity and the critical number (Q6532121) (← links)
- Linear-time uniform generation of random sparse contingency tables with specified marginals (Q6590451) (← links)
- A fully adaptive strategy for Hamiltonian cycles in the semi-random graph process (Q6591879) (← links)
