default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorics, Probability & Computing, Volume 10, 2001
Volume 10, Number 1, 2001
- Van H. Vu:
A Large Deviation Result On The Number Of Small Subgraphs Of A Random Graph. 79-94 - Andreas Nolte, Rainer Schrader:
Simulated Annealing And Graph Colouring. 29-40 - Christian Houdré, Prasad Tetali:
Concentration Of Measure For Products Of Markov Kernels And Graph Products Via Functional Inequalities. 1-28 - Alan D. Sokal:
Bounds On The Complex Zeros Of (Di)Chromatic Polynomials And Potts-Model Partition Functions. 41-77
Volume 10, Number 2, 2001
- Hans Jürgen Prömel, Angelika Steger, Anusch Taraz:
Counting Partial Orders With A Fixed Number Of Comparable Pairs. 159-177 - Paul Balister
:
On The Alspach Conjecture. 95-125 - Miguel Angel Fiol:
Some Spectral Characterizations Of Strongly Distance-Regular Graphs. 127-135 - Hongxun Qin:
Connected Matroids With Symmetric Tutte Polynomials. 179-186 - Jeff Kahn, János Komlós:
Singularity Probabilities For Random Matrices Over Finite Fields. 137-157
Volume 10, Number 3, May 2001
- Ron M. Adin, Yuval Roichman:
Descent Functions and Random Young Tableaux. 187-201 - Jürgen Bennies, Jim Pitman:
Asymptotics of the Hurwitz Binomial Distribution Related to Mixed Poisson Galton-Watson Trees. 203-211 - Alexander V. Gnedin, Sergei V. Kerov:
A Characterization of GEM Distributions. 213-217 - Jeff Kahn:
An Entropy Approach to the Hard-Core Model on Bipartite Graphs. 219-237 - C. F. Maclean, Neil O'Connell:
Random Finite Topologies and their Thresholds. 239-249 - Philippe Marchal:
A Combinatorial Approach to the Two-Sided Exit Problem for Left-Continuous Random Walks. 251-266 - Weifan Wang, Ko-Wei Lih:
Structural Properties and Edge Choosability of Planar Graphs without 6-Cycles. 267-276
Volume 10, Number 4, July 2001
- János Barát, Péter Hajnal:
Operations Which Preserve Path-Width at Most Two. 277-291 - Ourania Chryssaphinou, Stavros Papastavridis, Eutichia Vaggelatou:
Poisson Approximation for the Non-Overlapping Appearances of Several Words in Markov Chains. 293-308 - Emanuela Fachini, János Körner, Angelo Monti:
Self-Similarity Bounds for Locally Thin Set Families. 309-315 - H. L. Fu, C. A. Rodger:
4-Cycle Group-Divisible Designs with Two Associate Classes. 317-343 - Penny E. Haxell:
A Note on Vertex List Colouring. 345-347 - Braulio Maia Jr., Manoel Lemos:
Matroids Having Small Circumference. 349-360 - V. Nikiforov:
On the Minimum Number of k-Cliques in Graphs with Restricted Independence Number. 361-366
Volume 10, Number 5, 2001
- Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma:
G-Intersecting Families. 367-384 - Stéphane Boucheron, Wenceslas Fernandez de la Vega:
On The Independence Number Of Random Interval Graphs. 385-396 - Rosa E. Lillo, M. Martìn Dìaz:
Characterization Results Based On A Functional Derivative Approach. 417-434 - János Komlós, Gábor N. Sárközy, Endre Szemerédi:
Spanning Trees In Dense Graphs. 397-416 - Talmage James Reid, Haidong Wu:
On Minimally 3-Connected Binary Matroids. 453-461
Volume 10, Number 6, 2001
- Paul Balister:
Packing Circuits Into KN. - Emanuela Fachini, János Körner:
A Note On Counting Very Different Sequences. 501-504 - Stefan T. Mecay:
Maximum-Sized Matroids With No Minors Isomorphic To U2, 5, F7, F-7 Or P7. 531-542 - Vladimir Nikiforov:
On The Edge Distribution Of A Graph. 543-555 - Tibor Szabó, Gábor Tardos:
A Multidimensional Generalization Of The Erdös-Szekeres Lemma On Monotone Subsequences. 557-565 - Jan van den Heuvel:
Algorithmic Aspects Of A Chip-Firing Game. 505-529
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-02 21:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
