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?

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 for the previous two years. 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
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
The Average Displacement of the Simple Random Walk on the Sierpinski Graph ELMAR TEUFL Combinatorics, Probability and Computing, Volume 12, Issue 02, Mar 2003, pp 203-222 doi: 10.1017/S0963548302005540 (About doi), Published online by Cambridge University Press 17 Mar 2003 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
Quickselect and the Dickman Function HSIEN-KUEI HWANG and TSUNG-HSI TSAI Combinatorics, Probability and Computing, Volume 11, Issue 04, Jul 2002, pp 353-371 doi: 10.1017/S0963548302005138 (About doi), Published online by Cambridge University Press 06 Sep 2002 Preview Abstract Add to Basket £30.00 / $45.00 Request Permissions Abstract HTML Article Structure Figures and Tables References
Bootstrap Percolation on Infinite Trees and Non-Amenable Groups JÓZSEF BALOGH, YUVAL PERES and GÁBOR PETE Combinatorics, Probability and Computing, Volume 15, Issue 05, Sep 2006, pp 715-730 doi: 10.1017/S0963548306007619 (About doi), Published online by Cambridge University Press 31 Jul 2006 Preview Abstract Add to Basket £30.00 / $45.00 Request Permissions Abstract HTML Article Structure Figures and Tables References
On the Edge-Expansion of Graphs NOGA ALON Combinatorics, Probability and Computing, Volume 6, Issue 02, Jun 1997, pp 145-152 doi: 10.1017/S096354839700299X (About doi), 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
Concentration for Independent Permutations COLIN McDIARMID Combinatorics, Probability and Computing, Volume 11, Issue 02, Mar 2002, pp 163-178 doi: 10.1017/S0963548301005089 (About doi), Published online by Cambridge University Press 25 Apr 2002 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

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

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

The Average Displacement of the Simple Random Walk on the Sierpinski Graph

ELMAR TEUFL

Combinatorics, Probability and Computing, Volume 12, Issue 02, Mar 2003, pp 203-222

doi: 10.1017/S0963548302005540 (About doi), Published online by Cambridge University Press 17 Mar 2003

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

Quickselect and the Dickman Function

HSIEN-KUEI HWANG and TSUNG-HSI TSAI

Combinatorics, Probability and Computing, Volume 11, Issue 04, Jul 2002, pp 353-371

doi: 10.1017/S0963548302005138 (About doi), Published online by Cambridge University Press 06 Sep 2002

Bootstrap Percolation on Infinite Trees and Non-Amenable Groups

JÓZSEF BALOGH, YUVAL PERES and GÁBOR PETE

Combinatorics, Probability and Computing, Volume 15, Issue 05, Sep 2006, pp 715-730

doi: 10.1017/S0963548306007619 (About doi), Published online by Cambridge University Press 31 Jul 2006

On the Edge-Expansion of Graphs

NOGA ALON

Combinatorics, Probability and Computing, Volume 6, Issue 02, Jun 1997, pp 145-152

doi: 10.1017/S096354839700299X (About doi),

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),

Concentration for Independent Permutations

COLIN McDIARMID

Combinatorics, Probability and Computing, Volume 11, Issue 02, Mar 2002, pp 163-178

doi: 10.1017/S0963548301005089 (About doi), Published online by Cambridge University Press 25 Apr 2002