Quick Search:

Cite Search:

Home> Combinatorics, Probability and Computing> Top 10 Most-Cited Articles

Log In

Register Now
Guest
Username or Email Address Password
Athens Log In
Shibboleth Log In
Forgot your Password?

Cambridge Journals Digital Archive

Click here for details about our archive digitisation project. more details

2009 Journals Catalogue

Click here to download a PDF of our latest catalogue; a comprehensive guide to all of our journals. more details

CJO Now Includes:

567,269 articles from 321 leading journals.

Combinatorics, Probability and Computing

Top 10 Most-Cited Articles

These are the top 10 most-cited articles for this title. Most-cited rankings are updated on a monthly basis and provided by CrossRef.

Subscription Access
Free Access
Trial Access
Full Text HTML as well as PDF Articles Available

Note: Abstract, PDF and HTML open in a new window

Article Description		Save / Export / View citation	Add to Basket
View Selected Abstracts on one page	Select all
The Size of the Giant Component of a Random Graph with a Given Degree Sequence MICHAEL MOLLOY and BRUCE REED Combinatorics, Probability and Computing, Volume 7, Issue 03, Sep 1998, pp 295-305 doi: 10.1017/S0963548398003526 (About doi), Preview Abstract Add to Basket £30.00 / $45.00 Request Permissions Abstract HTML Article Structure Figures and Tables References
The Cycle Space of an Infinite Graph REINHARD DIESTEL Combinatorics, Probability and Computing, Volume 14, Issue 1-2, Jan 2005, pp 59-79 doi: 10.1017/S0963548304006686 (About doi), Published online by Cambridge University Press 15 Feb 2005 Preview Abstract Add to Basket £30.00 / $45.00 Request Permissions Abstract HTML Article Structure Figures and Tables References
The Largest Eigenvalue of Sparse Random Graphs MICHAEL KRIVELEVICH and BENNY SUDAKOV Combinatorics, Probability and Computing, Volume 12, Issue 01, Jan 2003, pp 61-72 doi: 10.1017/S0963548302005424 (About doi), Published online by Cambridge University Press 28 Jan 2003 Preview Abstract Add to Basket £30.00 / $45.00 Request Permissions Abstract HTML Article Structure Figures and Tables References
The Wiener Index of Random Trees RALPH NEININGER Combinatorics, Probability and Computing, Volume 11, Issue 06, Nov 2002, pp 587-597 doi: 10.1017/S0963548302005321 (About doi), Published online by Cambridge University Press 21 Nov 2002 Preview Abstract Add to Basket £30.00 / $45.00 Request Permissions Abstract HTML Article Structure Figures and Tables References
The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence COLIN COOPER and ALAN FRIEZE Combinatorics, Probability and Computing, Volume 13, Issue 03, May 2004, pp 319-337 doi: 10.1017/S096354830400611X (About doi), Published online by Cambridge University Press 28 Apr 2004 Preview Abstract Add to Basket £30.00 / $45.00 Request Permissions Abstract HTML Article Structure Figures and Tables References
A Note on a Question of Erdos and Graham J. SOLYMOSI Combinatorics, Probability and Computing, Volume 13, Issue 02, Mar 2004, pp 263-267 doi: 10.1017/S0963548303005959 (About doi), Published online by Cambridge University Press 03 Mar 2004 Preview Abstract Add to Basket £30.00 / $45.00 Request Permissions Abstract HTML Article Structure Figures and Tables References
On the Cover Time for Random Walks on Random Graphs JOHAN JONASSON Combinatorics, Probability and Computing, Volume 7, Issue 03, Sep 1998, pp 265-279 doi: 10.1017/S0963548398003538 (About doi), Preview Abstract Add to Basket £30.00 / $45.00 Request Permissions Abstract HTML Article Structure Figures and Tables References
Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width S. D. NOBLE Combinatorics, Probability and Computing, Volume 7, Issue 03, Sep 1998, pp 307-321 doi: 10.1017/S0963548398003551 (About doi), Preview Abstract Add to Basket £30.00 / $45.00 Request Permissions Abstract HTML Article Structure Figures and Tables References
Bipartite Subgraphs and the Smallest Eigenvalue NOGA ALON and BENNY SUDAKOV Combinatorics, Probability and Computing, Volume 9, Issue 01, Jan 2000, pp 1-12 doi: 10.1017/S0963548399004071 (About doi), Preview Abstract Add to Basket £30.00 / $45.00 Request Permissions Abstract HTML Article Structure Figures and Tables References
On the Number of Edges in Random Planar Graphs STEFANIE GERKE and COLIN McDIARMID Combinatorics, Probability and Computing, Volume 13, Issue 02, Mar 2004, pp 165-183 doi: 10.1017/S0963548303005947 (About doi), Published online by Cambridge University Press 03 Mar 2004 Preview Abstract Add to Basket £30.00 / $45.00 Request Permissions Abstract HTML Article Structure Figures and Tables References
View Selected Abstracts on one page	Select all
Article Description		Save / Export / View citation	Add to Basket

Back to Journal Homepage

Log In

Browse Journals

Special Sales

Cambridge Journals Digital Archive

2009 Journals Catalogue

CJO Now Includes:

Customize Your Search Toolbar

Combinatorics, Probability and Computing

Top 10 Most-Cited Articles

The Size of the Giant Component of a Random Graph with a Given Degree Sequence

MICHAEL MOLLOY and BRUCE REED

Combinatorics, Probability and Computing, Volume 7, Issue 03, Sep 1998, pp 295-305

doi: 10.1017/S0963548398003526 (About doi),

The Cycle Space of an Infinite Graph

REINHARD DIESTEL

Combinatorics, Probability and Computing, Volume 14, Issue 1-2, Jan 2005, pp 59-79

doi: 10.1017/S0963548304006686 (About doi), Published online by Cambridge University Press 15 Feb 2005

The Largest Eigenvalue of Sparse Random Graphs

MICHAEL KRIVELEVICH and BENNY SUDAKOV

Combinatorics, Probability and Computing, Volume 12, Issue 01, Jan 2003, pp 61-72

doi: 10.1017/S0963548302005424 (About doi), Published online by Cambridge University Press 28 Jan 2003

The Wiener Index of Random Trees

RALPH NEININGER

Combinatorics, Probability and Computing, Volume 11, Issue 06, Nov 2002, pp 587-597

doi: 10.1017/S0963548302005321 (About doi), Published online by Cambridge University Press 21 Nov 2002

The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence

COLIN COOPER and ALAN FRIEZE

Combinatorics, Probability and Computing, Volume 13, Issue 03, May 2004, pp 319-337

doi: 10.1017/S096354830400611X (About doi), Published online by Cambridge University Press 28 Apr 2004

A Note on a Question of Erdos and Graham

J. SOLYMOSI

Combinatorics, Probability and Computing, Volume 13, Issue 02, Mar 2004, pp 263-267

doi: 10.1017/S0963548303005959 (About doi), Published online by Cambridge University Press 03 Mar 2004

On the Cover Time for Random Walks on Random Graphs

JOHAN JONASSON

Combinatorics, Probability and Computing, Volume 7, Issue 03, Sep 1998, pp 265-279

doi: 10.1017/S0963548398003538 (About doi),

Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width

S. D. NOBLE

Combinatorics, Probability and Computing, Volume 7, Issue 03, Sep 1998, pp 307-321

doi: 10.1017/S0963548398003551 (About doi),

Bipartite Subgraphs and the Smallest Eigenvalue

NOGA ALON and BENNY SUDAKOV

Combinatorics, Probability and Computing, Volume 9, Issue 01, Jan 2000, pp 1-12

doi: 10.1017/S0963548399004071 (About doi),

On the Number of Edges in Random Planar Graphs

STEFANIE GERKE and COLIN McDIARMID

Combinatorics, Probability and Computing, Volume 13, Issue 02, Mar 2004, pp 165-183

doi: 10.1017/S0963548303005947 (About doi), Published online by Cambridge University Press 03 Mar 2004