- Journal of Combinatorial Theory, Series A 87, 381 389 (1999) An Upper Bound for the Turan Number t3(n, 4)
- A Random Graph Model for Massive Graphs William Aiello
- Graphs with scale-free degree sequence Joshua Cooper
- Diameter of random spanning trees in a given graph
- Internet Mathematics Vol. 1, No. 1: 91-114 The Average Distance in a
- The Research Statement of Linyuan Lu http://www.math.sc.edu/lu/research.html for more information
- Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. DISCRETE MATH. c 2008 Society for Industrial and Applied Mathematics
- On a problem of Erdos and Lovasz on coloring non-uniform hypergraphs
- A Random Graph Model for Power Law Graphs William Aiello, Fan Chung, and Linyuan Lu
- SIAM J. DISCRETE MATH. c 2006 Society for Industrial and Applied Mathematics Vol. 20, No. 2, pp. 395411
- Classification: Physical Sciences, Mathematics The average distances in random graphs with given expected degrees
- An exact result and its application on hypergraph Turan numbers
- Internet Mathematics Vol. 1, No. 4: 409-461 Coupling Online and Offline
- arXiv:0807.3702v1[math.CO]23Jul2008 On families of subsets with a forbidden subposet
- DOI: 10.1007/s00453-006-0160-2 Algorithmica (2007) 47: 379397
- RANDOM EVOLUTION IN MASSIVE GRAPHS William Aiello
- On Meyniel's conjecture of the cop number Linyuan Lu
- Internet Mathematics Vol. 2, No. 3: 359-385 Modeling the Small-World
- The Small World Phenomenon in Hybrid Power Law Graphs
- The giant component in a random subgraph of a given graph Fan Chung1 , Paul Horn1, and Linyuan Lu2
- CURRICULUM VITAE Linyuan Lincoln Lu
- Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. DISCRETE MATH. c 2010 Society for Industrial and Applied Mathematics
- Using Lovasz Local Lemma in the space of random injections
- The average distances in random graphs with given expected degrees
- GUESSING SECRETS WITH INNER PRODUCT QUESTIONS
- The Diameter of Random Massive Graphs Linyuan Lu
- Annals of Combinatorics 6 (2002) 125-145 0218-0006/02/020125-21
- Advances in Applied Mathematics 26, 257279 (2001) doi:10.1006/aama.2001.0720, available online at http://www.idealibrary.com on
- Internet Mathematics Vol. 3, No. 1: 79-127 Concentration Inequalities and
- Drawing Power Law Graphs using a Local/Global Decomposition Reid Andersen
- Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. DISCRETE MATH. c 2010 Society for Industrial and Applied Mathematics
- Discrete Mathematics 311 (2011) 13331343 Contents lists available at ScienceDirect
- Probabilistic Methods in Combinatorics
- Probabilistic Methods in Combinatorics
- Probabilistic Methods in Combinatorics
- RICCI CURVATURE OF GRAPHS and Linyuan Lu
- arXiv:0905.3983v2[math.CO]1Jul2011 A new asymptotic enumeration technique: the
- arXiv:1102.4409v1[math.CO]22Feb2011 High-ordered Random Walks and Generalized Laplacians
- A FRACTIONAL ANALOGUE OF BROOKS' THEOREM ANDREW D. KING , LINYUAN LU , AND XING PENG
- arXiv:1107.2888v1[math.CO]14Jul2011 Monochromatic 4-term arithmetic progressions
- Graphs with Diameter n -e Minimizing the Spectral Radius
- Probabilistic Methods in Combinatorics
- Probabilistic Methods in Combinatorics
- arXiv:1109.3433v1[math.CO]15Sep2011 Loose Laplacian spectra of random hypergraphs
- Journal of Combinatorial Theory, Series A 119 (2012) 310322 Contents lists available at SciVerse ScienceDirect
- arXiv:1011.2500v1[math.CO]10Nov2010 The Fractional Chromatic Number of
- Probabilistic Methods in Combinatorics
- Probabilistic Methods in Combinatorics
- Probabilistic Methods in Combinatorics
- Probabilistic Methods in Combinatorics
- Probabilistic Methods in Combinatorics
- Probabilistic Methods in Combinatorics
- Probabilistic Methods in Combinatorics
- Probabilistic Methods in Combinatorics
- Probabilistic Methods in Combinatorics
