default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorics, Probability & Computing, Volume 4, 1995
Volume 4, 1995
- Joseph E. Bonin
:
Automorphisms of Dowling and Related Geometries. 1-9 - Fan R. K. Chung, Shing-Tung Yau:
Eigenvalues of Graphs and Sobolev Inequalities. 11-25 - Reinhard Diestel:
Graph Minors 1: A Short Proof of the Path-width Theorem. 27-30 - Keith Edwards:
The Harmonious Chromatic Number of Almost All Trees. 31-46 - Alan M. Frieze, A. J. Radcliffe, Stephen Suen:
Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs. 47-66 - Fair Barbour Hurst, Talmage James Reid:
Some Small Circuit- Cocircuit Ramsey Numbers for Matroids. 67-80 - Wolfgang Mader:
On Vertices of Degree n in Minimally n-Edge-Connected Graphs. 81-95 - Jeong Han Kim:
On Brooks' Theorem for Sparse Graphs. 97-132 - Gregory F. Lawler:
Recurrence and Transience for a Card Shuffling Model. 133-142 - Guy Louchard, Wojciech Szpankowski:
A probabilistic Analysis of a String Editing Problem and its Variations. 143-166 - Oleg Verbitsky:
On the Hardness of Approximating Some Optimization Problems That Are Supposedly Easier Than MAX CLIQUE. 167-180 - John C. Wierman:
Substitution Method Critical Probability Bounds for the Square Lattice Site Percolation Model. 181-188 - A. El Maftouhi, Wenceslas Fernandez de la Vega:
On Random 3-sat. 189-195 - Takashi Hara, Gordon Slade:
The Self-Avoiding-Walk and Percolation Critical Points in High Dimensions. 197-215 - Penny E. Haxell, Yoshiharu Kohayakawa, Tomasz Luczak:
The Induced Size-Ramsey Number of Cycles. 217-239 - János Komlós, Gábor N. Sárközy, Endre Szemerédi:
proof of a Packing Conjecture of Bollobás. 241-255 - Colin McDiarmid, Bruce A. Reed:
Almost Every Graph can be Covered by [fracDelta2] Linear Forests. 257-268 - Frantisek Matús, Milan Studený:
Conditional Independences among Four Random Variables 1. 269-278 - Dudley Stark:
First Occurrence in Pairs of Long Words: A Penney-ante Conjecture of Pevzner. 279-285 - Mikkel Thorup:
Shortcutting Planar Digraphs. 287-315 - Gunnar Brinkmann, Brendan D. McKay, Carsten Saager:
The Smallest Cubic Graphs of Girth Nine. 317-329 - Tuhao Chen, Eugene Seneta:
Multivariate Identities, Permutation and Bonferroni Upper Bounds. 331-342 - Colin Cooper, Alan M. Frieze:
On the Connectivity of Random k-th Nearest Neighbour Graphs. 343-362 - Yahya Ould Hamidoune:
On Weighted Sequence Sums. 363-367 - Svante Janson:
Random Regular Graphs: Asymptotic Distributions and Contiguity. 369-405 - Frantisek Matús:
Conditional Independences among Four Random Variables 2. 407-417 - Laurent Saloff-Coste:
Isoperimetric Inequalities and Decay of Iterated Kernels for almost-transitive Markov Chains. 419-442
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 2025-11-28 12:47 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:
