Search Results

There are 34079 results for: content related to: The Geography of the Mathematics Research Collaboration Graph

  1. The Bohman-Frieze process near criticality

    Random Structures & Algorithms

    Volume 43, Issue 2, September 2013, Pages: 221–250, Mihyun Kang, Will Perkins and Joel Spencer

    Article first published online : 28 MAY 2012, DOI: 10.1002/rsa.20437

    Corrected by:

    Erratum: Erratum to “The Bohman-Frieze process near criticality”

    Vol. 46, Issue 4, 801, Article first published online: 30 MAR 2015

  2. For most graphs H, most H-free graphs have a linear homogeneous set

    Random Structures & Algorithms

    Volume 45, Issue 3, October 2014, Pages: 343–361, Ross J. Kang, Colin McDiarmid, Bruce Reed and Alex Scott

    Article first published online : 18 MAR 2013, DOI: 10.1002/rsa.20488

  3. Paul Erdős and probability theory

    Random Structures & Algorithms

    Volume 13, Issue 3-4, October - December 1998, Pages: 521–533, Béla Bollobás

    Article first published online : 7 DEC 1998, DOI: 10.1002/(SICI)1098-2418(199810/12)13:3/4<521::AID-RSA18>3.0.CO;2-0

  4. Open problems of Paul Erdös in graph theory

    Journal of Graph Theory

    Volume 25, Issue 1, May 1997, Pages: 3–36, F. R. K. Chung

    Article first published online : 7 DEC 1998, DOI: 10.1002/(SICI)1097-0118(199705)25:1<3::AID-JGT1>3.0.CO;2-R

  5. The chromatic Ramsey number of odd wheels

    Journal of Graph Theory

    Volume 69, Issue 2, February 2012, Pages: 198–205, Nathalie Paul and Claude Tardif

    Article first published online : 1 FEB 2011, DOI: 10.1002/jgt.20575

  6. Cycle packing

    Random Structures & Algorithms

    Volume 45, Issue 4, December 2014, Pages: 608–626, David Conlon, Jacob Fox and Benny Sudakov

    Article first published online : 16 OCT 2014, DOI: 10.1002/rsa.20574

  7. Quadratic Upper Bounds on the Erdős–Pósa Property for a Generalization of Packing and Covering Cycles

    Journal of Graph Theory

    Volume 74, Issue 4, December 2013, Pages: 417–424, Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip and Saket Saurabh

    Article first published online : 24 JAN 2013, DOI: 10.1002/jgt.21720

  8. You have free access to this content
    Hypothesis testing for automated community detection in networks

    Journal of the Royal Statistical Society: Series B (Statistical Methodology)

    Volume 78, Issue 1, January 2016, Pages: 253–273, Peter J. Bickel and Purnamrita Sarkar

    Article first published online : 21 MAY 2015, DOI: 10.1111/rssb.12117

  9. Discrepancy properties for random regular digraphs

    Random Structures & Algorithms

    Nicholas A. Cook

    Article first published online : 1 MAR 2016, DOI: 10.1002/rsa.20643

  10. Complete Partite subgraphs in dense hypergraphs

    Random Structures & Algorithms

    Volume 41, Issue 4, December 2012, Pages: 557–573, Vojtěch Rödl and Mathias Schacht

    Article first published online : 25 JUN 2012, DOI: 10.1002/rsa.20441

  11. On replica symmetry of large deviations in random graphs

    Random Structures & Algorithms

    Volume 47, Issue 1, August 2015, Pages: 109–146, Eyal Lubetzky and Yufei Zhao

    Article first published online : 29 APR 2014, DOI: 10.1002/rsa.20536

  12. Stability results for random discrete structures

    Random Structures & Algorithms

    Volume 44, Issue 3, May 2014, Pages: 269–289, Wojciech Samotij

    Article first published online : 6 DEC 2012, DOI: 10.1002/rsa.20477

  13. Strengthening Erdös–Pósa property for minor-closed graph classes

    Journal of Graph Theory

    Volume 66, Issue 3, March 2011, Pages: 235–240, Fedor V. Fomin, Saket Saurabh and Dimitrios M. Thilikos

    Article first published online : 26 OCT 2010, DOI: 10.1002/jgt.20503

  14. Bayesian Inference for Contact Networks Given Epidemic Data

    Scandinavian Journal of Statistics

    Volume 38, Issue 3, September 2011, Pages: 600–616, CHRIS GROENDYKE, DAVID WELCH and DAVID R. HUNTER

    Article first published online : 22 DEC 2010, DOI: 10.1111/j.1467-9469.2010.00721.x

  15. On a Conjecture of Erdős, Gallai, and Tuza

    Journal of Graph Theory

    Volume 80, Issue 1, September 2015, Pages: 12–17, Gregory J. Puleo

    Article first published online : 15 OCT 2014, DOI: 10.1002/jgt.21828

  16. A Network-based Analysis of the 1861 Hagelloch Measles Data

    Biometrics

    Volume 68, Issue 3, September 2012, Pages: 755–765, Chris Groendyke, David Welch and David R. Hunter

    Article first published online : 24 FEB 2012, DOI: 10.1111/j.1541-0420.2012.01748.x

  17. Nobel numbers: Time-dependent centrality measures on coauthorship graphs

    Journal of the Association for Information Science and Technology

    Chris Fields

    Article first published online : 1 JUN 2015, DOI: 10.1002/asi.23547

  18. A Tighter Erdős-Pósa Function for Long Cycles

    Journal of Graph Theory

    Volume 77, Issue 2, September 2014, Pages: 111–116, Samuel Fiorini and Audrey Herinckx

    Article first published online : 5 DEC 2013, DOI: 10.1002/jgt.21776

  19. Random coloring method in the combinatorial problem of Erdős and Lovász

    Random Structures & Algorithms

    Volume 40, Issue 2, March 2012, Pages: 227–253, Dmitry A. Shabanov

    Article first published online : 30 MAR 2011, DOI: 10.1002/rsa.20366

  20. Collaboration in computer science: A network science approach

    Journal of the American Society for Information Science and Technology

    Volume 62, Issue 10, October 2011, Pages: 1992–2012, Massimo Franceschet

    Article first published online : 28 JUL 2011, DOI: 10.1002/asi.21614