Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorics, Probability & Computing, Volume 7, 1998
Volume 7, Number 1, March 1998
- David J. Aldous:
On the Critical Value for 'Percolation' of Minimum-Weight Trees in the Mean-Field Distance Model. 1-10 - Sven Erick Alm:
A Note on a Problem by Welsh in First-Passage Percolation. 11-15 - Jørgen Bang-Jensen, Tibor Jordán:
Adding and Reversing Arcs in Semicomplete Digraphs. 17-25 - Neil J. Calkin, Peter J. Cameron:
Almost Odd Random Sum-Free Sets. 27-32 - Dwight Duffus, Tomasz Luczak, Vojtech Rödl, Andrzej Rucinski:
Endomorphisms of Partially Ordered Sets. 33-46 - Peter Frankl, Katsuhiro Ota, Norihide Tokushige:
Uniform Intersecting Families with Covering Number Restrictions. 47-56 - David A. Grable:
A Large Deviation Inequality for Functions of Independent, Multi-Way Choices. 57-63 - David S. Gunderson, Vojtech Rödl:
Extremal Problems for Affine Cubes of Integers. 65-79 - Yahya Ould Hamidoune:
Adding Distinct Congruence Classes. 81-87 - Hsien-Kuei Hwang:
A Poisson * Geometric Convolution Law for the Number of Components in Unlabelled Combinatorial Structures. 89-110 - Peter Kirschenhofer, Helmut Prodinger:
Comparisons in Hoare's Find Algorithm. 111-120 - János Pach, Micha Sharir:
On the Number of Incidences Between Points and Curves. 121-127
Volume 7, Number 2, 1998
- Gunnar Brinkmann:
All Ramsey Numbers r(K3, G) for Connected Graphs of Order 7 and 8. 129-140 - Fan R. K. Chung, Prasad Tetali:
Isoperimetric Inequalities for Cartesian Products of Graphs. 141-148 - A. W. F. Edwards:
Seven-Set Venn Diagrams with Rotational and Polar Symmetry. 149-152 - Hugh Edwards, Robert M. Hierons, Bill Jackson:
The Zero-Free Intervals for Characteristic Polynomials of Matroids. 153-165 - Neil Hindman, Dona Strauss:
An Algebraic Proof of Deuber's Theorem. 167-180 - Martin Juvan, Bojan Mohar, Riste Skrekovski:
List Total Colourings of Graphs. 181-188 - László Lovász, Peter Winkler:
Reversal of Markov Chains and the Forget Time. 189-204 - András Lukács:
On Local Expansion of Vertex-Transitive Graphs. 205-209 - Michele Mosca:
Removing Edges Can Increase the Average Number of Colours in the Colourings of a Graph. 211-216 - Richard H. Schelp, Andrew Thomason:
A Remark on the Number of Complete and Empty Subgraphs. 217-219 - William T. Trotter, Peter Winkler:
Ramsey Theory and Sequences of Random Variables. 221-238
Volume 7, Number 3, September 1998
- M. D. Atkinson:
Generalized Stack Permutations. 239-246 - Peter Frankl, Norihide Tokushige:
Some Inequalities Concerning Cross-Intersecting Families. 247-260 - Weidong Gao, Yahya Ould Hamidoune:
Zero Sums in Abelian Groups. 261-263 - Johan Jonasson:
On the Cover Time for Random Walks on Random Graphs. 265-279 - Akira Maruoka, Mike Paterson, Hirotaka Koizumi:
Consistency of Natural Relations on Sets. 281-293 - Michael Molloy, Bruce A. Reed:
The Size of the Giant Component of a Random Graph with a Given Degree Sequence. 295-305 - Steven D. Noble:
Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width. 307-321 - Andrzej Pelc, Eli Upfal:
Reliable Fault Diagnosis with Few Tests. 323-333 - Shuji Shiraishi:
On the Maximum Cut of Line Graphs. 335-337
Volume 7, Number 4, December 1998
- Malgorzata Bednarska:
On Biased Positional Games. 339-351 - Tuhao Chen, Eugene Seneta:
Lower Bounds for the Probability of Intersection of Several Unions of Events. 353-364 - Vlado Dancík:
Common Subsequences and Supersequences and their Expected Length. 365-373 - Thomas Emden-Weinert, Stefan Hougardy, Bernd Kreuter:
Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth. 375-386 - Petros Hadjicostas:
The Asymptotic Proportion of Subdivisions of a 2×2 Table that Result in Simpson's Paradox. 387-396 - Olle Häggström:
On a Conjecture of Bollobás and Brightwell Concerning Random Walks on Product Graphs. 397-401 - Yahya Ould Hamidoune, Oscar Ordaz, Asdrubal Ortuño:
On a Combinatorial Theorem of Erdös, Ginzburg and Ziv. 403-412 - Chris Jagger:
Distant Vertex Partitions of Graphs. 413-422 - Tomasz Luczak, Vojtech Rödl, Endre Szemerédi:
Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles. 423-436 - Brendan D. McKay, Robert W. Robinson:
Asymptotic Enumeration of Eulerian Circuits in the Complete Graph. 437-449 - Petr Savický:
Complexity and Probability of Some Boolean Formulas. 451-463 - Kyle Siegrist:
Expected Value Expansions in Random Subgraphs with Applications to Network Reliability. 465-483 - Haidong Wu:
On Vertex-Triads in 3-Connected Binary Matroids. 485-497
a service of 
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-06-19 21:49 CEST 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:
