| 2009 |
|---|
| 190 | EE | Noga Alon,
Béla Bollobás:
Introduction.
Combinatorics, Probability & Computing 18(1-2): 1 (2009) |
| 189 | EE | József Balogh,
Béla Bollobás,
Robert Morris:
Majority Bootstrap Percolation on the Hypercube.
Combinatorics, Probability & Computing 18(1-2): 17-51 (2009) |
| 188 | EE | Béla Bollobás,
Svante Janson,
Oliver Riordan:
Line-of-Sight Percolation.
Combinatorics, Probability & Computing 18(1-2): 83-106 (2009) |
| 187 | EE | Paul N. Balister,
Béla Bollobás,
Amites Sarkar,
Mark Walters:
Highly connected random geometric graphs.
Discrete Applied Mathematics 157(2): 309-320 (2009) |
| 186 | EE | József Balogh,
Béla Bollobás,
Michael E. Saks,
Vera T. Sós:
The unlabelled speed of a hereditary graph property.
J. Comb. Theory, Ser. B 99(1): 9-19 (2009) |
| 185 | EE | József Balogh,
Béla Bollobás,
Miklós Simonovits:
The typical structure of graphs without given excluded subgraphs.
Random Struct. Algorithms 34(3): 305-318 (2009) |
| 2008 |
|---|
| 184 | EE | Béla Bollobás,
Guy Kindler,
Imre Leader,
Ryan O'Donnell:
Eliminating Cycles in the Discrete Torus.
Algorithmica 50(4): 446-454 (2008) |
| 183 | EE | Béla Bollobás,
Vladimir Nikiforov:
Joints in graphs.
Discrete Mathematics 308(1): 9-19 (2008) |
| 182 | EE | Béla Bollobás,
Ervin Györi:
Pentagons vs. triangles.
Discrete Mathematics 308(19): 4332-4336 (2008) |
| 181 | EE | Béla Bollobás,
Vladimir Nikiforov:
Graphs and Hermitian matrices: Exact interlacing.
Discrete Mathematics 308(20): 4816-4821 (2008) |
| 180 | EE | Béla Bollobás,
András Gyárfás:
Highly connected monochromatic subgraphs.
Discrete Mathematics 308(9): 1722-1725 (2008) |
| 179 | EE | Paul N. Balister,
Béla Bollobás,
Amites Sarkar,
Mark Walters:
Connectivity of a Gaussian network.
IJAHUC 3(3): 204-213 (2008) |
| 178 | EE | Béla Bollobás,
Alexandr V. Kostochka,
Kittikorn Nakprasit:
Packing d-degenerate graphs.
J. Comb. Theory, Ser. B 98(1): 85-94 (2008) |
| 177 | EE | Paul Balister,
Béla Bollobás,
Stefanie Gerke:
Connectivity of addable graph classes.
J. Comb. Theory, Ser. B 98(3): 577-584 (2008) |
| 176 | EE | Béla Bollobás,
Oliver Riordan:
Percolation on dual lattices with k-fold symmetry.
Random Struct. Algorithms 32(4): 463-472 (2008) |
| 2007 |
|---|
| 175 | EE | Paul Balister,
Béla Bollobás,
Amites Sarkar,
Santosh Kumar:
Reliable density estimates for coverage and connectivity in thin strips of finite length.
MOBICOM 2007: 75-86 |
| 174 | EE | József Balogh,
Béla Bollobás,
Robert Morris:
Hereditary Properties of Tournaments.
Electr. J. Comb. 14(1): (2007) |
| 173 | EE | Béla Bollobás,
Alex D. Scott:
On separating systems.
Eur. J. Comb. 28(4): 1068-1071 (2007) |
| 172 | EE | Béla Bollobás,
Oliver Riordan:
A note on the Harris-Kesten Theorem.
Eur. J. Comb. 28(6): 1720-1723 (2007) |
| 171 | EE | Béla Bollobás,
Alex D. Scott:
Separating systems and oriented graphs of diameter two.
J. Comb. Theory, Ser. B 97(2): 193-203 (2007) |
| 170 | EE | Béla Bollobás,
Vladimir Nikiforov:
Cliques and the spectral radius.
J. Comb. Theory, Ser. B 97(5): 859-865 (2007) |
| 169 | EE | Noga Alon,
Béla Bollobás,
András Gyárfás,
Jenö Lehel,
Alex D. Scott:
Maximum directed cuts in acyclic digraphs.
Journal of Graph Theory 55(1): 1-13 (2007) |
| 168 | EE | Paul N. Balister,
Béla Bollobás,
Stefanie Gerke:
The generalized Randic index of trees.
Journal of Graph Theory 56(4): 270-286 (2007) |
| 167 | EE | József Balogh,
Béla Bollobás,
Robert Morris:
Hereditary properties of combinatorial structures: Posets and oriented graphs.
Journal of Graph Theory 56(4): 311-332 (2007) |
| 166 | EE | Béla Bollobás,
Svante Janson,
Oliver Riordan:
The phase transition in inhomogeneous random graphs.
Random Struct. Algorithms 31(1): 3-122 (2007) |
| 165 | EE | Béla Bollobás,
Svante Janson,
Oliver Riordan:
Spread-out percolation in Rd.
Random Struct. Algorithms 31(2): 239-246 (2007) |
| 164 | EE | Noam Berger,
Béla Bollobás,
Christian Borgs,
Jennifer T. Chayes,
Oliver Riordan:
Degree distribution of the FKP network model.
Theor. Comput. Sci. 379(3): 306-316 (2007) |
| 2006 |
|---|
| 163 | EE | Béla Bollobás,
Guy Kindler,
Imre Leader,
Ryan O'Donnell:
Eliminating Cycles in the Discrete Torus.
LATIN 2006: 202-210 |
| 162 | EE | Béla Bollobás,
Andrew Thomason:
Set colourings of graphs.
Discrete Mathematics 306(10-11): 948-952 (2006) |
| 161 | EE | Paul N. Balister,
Béla Bollobás:
Pair dominating graphs.
Eur. J. Comb. 27(2): 322-328 (2006) |
| 160 | EE | József Balogh,
Béla Bollobás,
Robert Morris:
Hereditary properties of partitions, ordered graphs and ordered hypergraphs.
Eur. J. Comb. 27(8): 1263-1281 (2006) |
| 159 | EE | Béla Bollobás,
Imre Leader:
The Angel and the Devil in three dimensions.
J. Comb. Theory, Ser. A 113(1): 176-184 (2006) |
| 158 | EE | Yair Bartal,
Béla Bollobás,
Manor Mendel:
Ramsey-type theorems for metric spaces with applications to online problems.
J. Comput. Syst. Sci. 72(5): 890-921 (2006) |
| 157 | EE | Béla Bollobás,
Graham Brightwell:
How many graphs are unions of k-cliques?
Journal of Graph Theory 52(2): 87-107 (2006) |
| 156 | EE | Béla Bollobás,
Jeong Han Kim,
Jacques Verstraëte:
Regular subgraphs of random graphs.
Random Struct. Algorithms 29(1): 1-13 (2006) |
| 155 | EE | Paul N. Balister,
Béla Bollobás,
Robert Kozma:
Large deviations for mean field models of probabilistic cellular automata.
Random Struct. Algorithms 29(3): 399-415 (2006) |
| 154 | EE | Béla Bollobás,
Oliver Riordan:
Sharp thresholds and percolation in the plane.
Random Struct. Algorithms 29(4): 524-548 (2006) |
| 153 | EE | Sanjeev Arora,
Béla Bollobás,
László Lovász,
Iannis Tourlakis:
Proving Integrality Gaps without Knowing the Linear Program.
Theory of Computing 2(1): 19-51 (2006) |
| 2005 |
|---|
| 152 | EE | Robert Kozma,
Marko Puljic,
Paul Balister,
Béla Bollobás,
Walter J. Freeman:
Phase transitions in the neuropercolation model of neural populations with mixed local and non-local interactions.
Biological Cybernetics 92(6): 367-379 (2005) |
| 151 | EE | József Balogh,
Béla Bollobás:
Unavoidable Traces Of Set Systems.
Combinatorica 25(6): 633-643 (2005) |
| 150 | EE | Béla Bollobás,
Vladimir Nikiforov:
The Sum of Degrees in Cliques.
Electr. J. Comb. 12: (2005) |
| 149 | EE | Béla Bollobás,
Vladimir Nikiforov:
Books in graphs.
Eur. J. Comb. 26(2): 259-270 (2005) |
| 148 | EE | Béla Bollobás,
Oleg Pikhurko:
Integer sets with prescribed pairwise differences being distinct.
Eur. J. Comb. 26(5): 607-616 (2005) |
| 147 | EE | József Balogh,
Béla Bollobás,
David Weinreich:
A jump to the bell number for hereditary graph properties.
J. Comb. Theory, Ser. B 95(1): 29-48 (2005) |
| 146 | EE | Béla Bollobás,
Svante Janson,
Oliver Riordan:
The phase transition in the uniformly grown random graph has infinite order.
Random Struct. Algorithms 26(1-2): 1-36 (2005) |
| 145 | EE | Paul N. Balister,
Béla Bollobás,
Anthony Quas:
Percolation in Voronoi tilings.
Random Struct. Algorithms 26(3): 310-318 (2005) |
| 144 | EE | Paul N. Balister,
Béla Bollobás,
Mark Walters:
Continuum percolation with steps in the square or the disc.
Random Struct. Algorithms 26(4): 392-403 (2005) |
| 143 | EE | Béla Bollobás,
Oliver Riordan:
Slow emergence of the giant component in the growing m-out graph.
Random Struct. Algorithms 27(1): 1-24 (2005) |
| 142 | EE | Béla Bollobás,
Don Coppersmith,
Michael Elkin:
Sparse Distance Preservers and Additive Spanners.
SIAM J. Discrete Math. 19(4): 1029-1055 (2005) |
| 2004 |
|---|
| 141 | EE | Robert Kozma,
Marko Puljic,
Paul Balister,
Béla Bollobás,
Walter J. Freeman:
Neuropercolation: A Random Cellular Automata Approach to Spatio-temporal Neurodynamics.
ACRI 2004: 435-443 |
| 140 | EE | Béla Bollobás,
Oliver Riordan:
The Phase Transition and Connectedness in Uniformly Grown Random Graphs.
WAW 2004: 1-18 |
| 139 | EE | Yair Bartal,
Béla Bollobás,
Manor Mendel:
Ramsey-type theorems for metric spaces with applications to online problems
CoRR cs.DS/0406028: (2004) |
| 138 | EE | Béla Bollobás,
Oliver Riordan:
The Diameter of a Scale-Free Random Graph.
Combinatorica 24(1): 5-34 (2004) |
| 137 | EE | Béla Bollobás,
David Gamarnik,
Oliver Riordan,
Benny Sudakov:
On the Value of a Random Minimum Weight Steiner Tree.
Combinatorica 24(2): 187-207 (2004) |
| 136 | EE | Richard Arratia,
Béla Bollobás,
Gregory B. Sorkin:
A Two-Variable Interlace Polynomial.
Combinatorica 24(4): 567-584 (2004) |
| 135 | | Béla Bollobás:
How Sharp is the Concentration of the Chromatic Number?
Combinatorics, Probability & Computing 13(1): 115-117 (2004) |
| 134 | | Béla Bollobás,
Imre Leader:
Isoperimetric Problems for r-sets.
Combinatorics, Probability & Computing 13(2): 277-279 (2004) |
| 133 | EE | Béla Bollobás,
Alex D. Scott:
Max Cut for Random Graphs with a Planted Partition.
Combinatorics, Probability & Computing 13(4-5): 451-474 (2004) |
| 132 | EE | Béla Bollobás,
Vladimir Nikiforov:
Hermitian matrices and graphs: singular values and discrepancy.
Discrete Mathematics 285(1-3): 17-32 (2004) |
| 131 | EE | Béla Bollobás,
Vladimir Nikiforov:
Graphs and Hermitian matrices: eigenvalue interlacing.
Discrete Mathematics 289(1-3): 119-127 (2004) |
| 130 | EE | Béla Bollobás,
Vladimir Nikiforov:
Degree Powers in Graphs with Forbidden Subgraphs.
Electr. J. Comb. 11(1): (2004) |
| 129 | EE | Béla Bollobás,
Peter Keevash,
Benny Sudakov:
Multicoloured extremal problems.
J. Comb. Theory, Ser. A 107(2): 295-312 (2004) |
| 128 | EE | József Balogh,
Béla Bollobás,
Miklós Simonovits:
The number of graphs without forbidden subgraphs.
J. Comb. Theory, Ser. B 91(1): 1-24 (2004) |
| 127 | EE | Richard Arratia,
Béla Bollobás,
Gregory B. Sorkin:
The interlace polynomial of a graph.
J. Comb. Theory, Ser. B 92(2): 199-233 (2004) |
| 126 | EE | Béla Bollobás,
Alex D. Scott:
Judicious partitions of bounded-degree graphs.
Journal of Graph Theory 46(2): 131-143 (2004) |
| 2003 |
|---|
| 125 | EE | Noam Berger,
Béla Bollobás,
Christian Borgs,
Jennifer T. Chayes,
Oliver Riordan:
Degree Distribution of the FKP Network Model.
ICALP 2003: 725-738 |
| 124 | EE | Béla Bollobás,
Christian Borgs,
Jennifer T. Chayes,
Oliver Riordan:
Directed scale-free graphs.
SODA 2003: 132-139 |
| 123 | EE | Béla Bollobás,
Don Coppersmith,
Michael Elkin:
Sparse distance preservers and additive spanners.
SODA 2003: 414-423 |
| 122 | EE | Béla Bollobás,
Imre Leader:
Set Systems with few Disjoint Pairs.
Combinatorica 23(4): 559-570 (2003) |
| 121 | | Béla Bollobás,
Graham Brightwell,
Yoshiharu Kohayakawa,
Imre Leader,
Alex D. Scott:
Special Issue on Ramsey Theory.
Combinatorics, Probability & Computing 12(5-6): 467-468 (2003) |
| 120 | | Béla Bollobás,
Andrew Thomason:
Frank Ramsey.
Combinatorics, Probability & Computing 12(5-6): 469-475 (2003) |
| 119 | EE | Béla Bollobás,
Amites Sarkar:
Paths of length four.
Discrete Mathematics 265(1-3): 357-363 (2003) |
| 118 | | Béla Bollobás,
Oliver Riordan:
Robustness and Vulnerability of Scale-Free Random Graphs.
Internet Mathematics 1(1): (2003) |
| 117 | | Béla Bollobás,
Oliver Riordan:
Coupling Scale-Free and Classical Random Graphs.
Internet Mathematics 1(2): (2003) |
| 116 | EE | Béla Bollobás,
Oliver Riordan:
Disjointly representing set systems.
J. Comb. Theory, Ser. A 102(1): 1-9 (2003) |
| 115 | EE | Paul Balister,
Béla Bollobás,
Oliver Riordan,
Richard H. Schelp:
Graphs with large maximum degree containing no odd cycles of a given length.
J. Comb. Theory, Ser. B 87(2): 366-373 (2003) |
| 114 | EE | Noga Alon,
Béla Bollobás,
Michael Krivelevich,
Benny Sudakov:
Maximum cuts and judicious partitions in graphs without short cycles.
J. Comb. Theory, Ser. B 88(2): 329-346 (2003) |
| 113 | EE | Béla Bollobás,
Graham Brightwell:
The number of k-SAT functions.
Random Struct. Algorithms 22(3): 227-247 (2003) |
| 112 | EE | Béla Bollobás,
Imre Leader:
Union of shadows.
Theor. Comput. Sci. 307(3): 493-502 (2003) |
| 2002 |
|---|
| 111 | EE | Sanjeev Arora,
Béla Bollobás,
László Lovász:
Proving Integrality Gaps without Knowing the Linear Program.
FOCS 2002: 313-322 |
| 110 | | József Balogh,
Béla Bollobás,
David Weinreich:
Measures on monotone properties of graphs.
Discrete Applied Mathematics 116(1-2): 17-36 (2002) |
| 109 | EE | Béla Bollobás,
Paul Erdös,
Ralph J. Faudree,
Cecil C. Rousseau,
Richard H. Schelp:
Random induced graphs.
Discrete Mathematics 248(1-3): 249-254 (2002) |
| 108 | EE | Paul N. Balister,
Béla Bollobás,
Richard H. Schelp:
Vertex distinguishing colorings of graphs with Delta(G)=2.
Discrete Mathematics 252(1-3): 17-29 (2002) |
| 107 | EE | Noga Alon,
József Balogh,
Béla Bollobás,
Tamás Szabó:
Game domination number.
Discrete Mathematics 256(1-2): 23-33 (2002) |
| 106 | EE | Paul Balister,
Béla Bollobás,
J. Cutler,
Luke Pebody:
The Interlace Polynomial of Graphs at - 1.
Eur. J. Comb. 23(7): 761-767 (2002) |
| 105 | EE | Béla Bollobás:
Evaluations of the Circuit Partition Polynomial.
J. Comb. Theory, Ser. B 85(2): 261-268 (2002) |
| 104 | EE | Béla Bollobás,
Alex D. Scott:
Problems and results on judicious partitions.
Random Struct. Algorithms 21(3-4): 414-430 (2002) |
| 2001 |
|---|
| 103 | | Yair Bartal,
Béla Bollobás,
Manor Mendel:
A Ramsy-type Theorem for Metric Spaces and its Applications for Metrical Task Systems and Related Problems.
FOCS 2001: 396-405 |
| 102 | EE | Paul N. Balister,
Béla Bollobás,
Oliver Riordan,
Alex D. Scott:
Alternating Knot Diagrams, Euler Circuits and the Interlace Polynomial.
Eur. J. Comb. 22(1): 1-4 (2001) |
| 101 | EE | József Balogh,
Béla Bollobás,
David Weinreich:
The Penultimate Rate of Growth for Graph Properties.
Eur. J. Comb. 22(3): 277-289 (2001) |
| 100 | | Béla Bollobás,
Jair Donadelli,
Yoshiharu Kohayakawa,
Richard H. Schelp:
Ramsey minimal graphs.
J. Braz. Comp. Soc. 7(3): 27-37 (2001) |
| 99 | EE | Béla Bollobás,
Gautam Das,
Dimitrios Gunopulos,
Heikki Mannila:
Time-Series Similarity Problems and Well-Separated Geometric Sets.
Nord. J. Comput. 8(4): 409-423 (2001) |
| 98 | | Béla Bollobás,
Christian Borgs,
Jennifer T. Chayes,
Jeong Han Kim,
David Bruce Wilson:
The scaling window of the 2-SAT transition.
Random Struct. Algorithms 18(3): 201-256 (2001) |
| 97 | | Béla Bollobás,
Oliver Riordan,
Joel Spencer,
Gábor E. Tusnády:
The degree sequence of a scale-free random graph process.
Random Struct. Algorithms 18(3): 279-290 (2001) |
| 2000 |
|---|
| 96 | EE | Richard Arratia,
Béla Bollobás,
Gregory B. Sorkin:
The interlace polynomial: a new graph polynomial.
SODA 2000: 237-245 |
| 95 | EE | Béla Bollobás,
Andrew Thomason:
The Structure of Hereditary Properties and Colourings of Random Graphs.
Combinatorica 20(2): 173-202 (2000) |
| 94 | | Richard Arratia,
Béla Bollobás,
Don Coppersmith,
Gregory B. Sorkin:
Euler circuits and DNA sequencing by hybridization.
Discrete Applied Mathematics 104(1-3): 63-96 (2000) |
| 93 | EE | Béla Bollobás,
Douglas B. West:
A note on generalized chromatic number and generalized girth.
Discrete Mathematics 213(1-3): 29-34 (2000) |
| 92 | EE | Béla Bollobás,
Oliver Riordan:
Polychromatic polynomials.
Discrete Mathematics 219(1-3): 1-7 (2000) |
| 91 | EE | Béla Bollobás,
Oliver Riordan:
Constrained Graph Processes.
Electr. J. Comb. 7: (2000) |
| 90 | EE | Béla Bollobás,
Alex D. Scott:
Judicious Partitions of 3-uniform Hypergraphs.
Eur. J. Comb. 21(3): 289-300 (2000) |
| 89 | EE | Béla Bollobás,
Alexandr V. Kostochka,
Richard H. Schelp:
Local and Mean Ramsey Numbers for Trees.
J. Comb. Theory, Ser. B 79(1): 100-103 (2000) |
| 88 | EE | József Balogh,
Béla Bollobás,
David Weinreich:
The Speed of Hereditary Properties of Graphs.
J. Comb. Theory, Ser. B 79(2): 131-156 (2000) |
| 87 | EE | Béla Bollobás,
Luke Pebody,
Oliver Riordan:
Contraction-Deletion Invariants for Graphs.
J. Comb. Theory, Ser. B 80(2): 320-345 (2000) |
| 1999 |
|---|
| 86 | EE | Béla Bollobás,
Alex D. Scott:
Exact Bounds for Judicious Partitions of Graphs.
Combinatorica 19(4): 473-486 (1999) |
| 85 | EE | Béla Bollobás,
Oliver Riordan,
Zdenek Ryjácek,
Akira Saito,
Richard H. Schelp:
Closure and Hamiltonian-connectivity of claw-free graphs.
Discrete Mathematics 195(1-3): 67-80 (1999) |
| 84 | EE | Béla Bollobás,
Paul Erdös,
Amites Sarkar:
Extremal graphs for weights.
Discrete Mathematics 200(1-3): 5-19 (1999) |
| 83 | EE | Béla Bollobás,
Graham Brightwell,
Alexander Sidorenko:
Geometrical Techniques for Estimating Numbers of Linear Extensions.
Eur. J. Comb. 20(5): 329-335 (1999) |
| 82 | EE | Béla Bollobás:
Turán's Theorem and Maximal Degrees.
J. Comb. Theory, Ser. B 75(1): 160-164 (1999) |
| 81 | EE | Béla Bollobás,
Andrew Thomason:
Weakly Pancyclic Graphs.
J. Comb. Theory, Ser. B 77(1): 121-137 (1999) |
| 80 | | Paul Balister,
Béla Bollobás,
Alan Stacey:
Counting Boundary Paths for Oriented Percolation Clusters.
Random Struct. Algorithms 14(1): 1-28 (1999) |
| 1998 |
|---|
| 79 | | Béla Bollobás,
Paul Erdös:
Graphs of Extremal Weights.
Ars Comb. 50: (1998) |
| 78 | EE | Béla Bollobás,
Oliver Riordan:
On some conjectures of Graffiti.
Discrete Mathematics 179(1-3): 223-230 (1998) |
| 77 | EE | Béla Bollobás,
Tamás Szabó:
The oriented cycle game.
Discrete Mathematics 186(1-3): 55-67 (1998) |
| 76 | EE | Béla Bollobás,
Andrew Thomason:
Proof of a Conjecture of Mader, Erdös and Hajnal on Topological Complete Subgraphs.
Eur. J. Comb. 19(8): 883-887 (1998) |
| 75 | | Béla Bollobás,
Oliver Riordan:
Colorings generated by monotone properties.
Random Struct. Algorithms 12(1): 1-25 (1998) |
| 74 | | Béla Bollobás:
Paul Erdös and probability theory.
Random Struct. Algorithms 13(3-4): 521-533 (1998) |
| 1997 |
|---|
| 73 | EE | Béla Bollobás,
Gautam Das,
Dimitrios Gunopulos,
Heikki Mannila:
Time-Series Similarity Problems and Well-Separated Geometric Sets.
Symposium on Computational Geometry 1997: 454-456 |
| 72 | EE | Béla Bollobás,
Graham Brightwell:
Random Walks and Electrical Resistances in Products of Graphs.
Discrete Applied Mathematics 73(1): 69-79 (1997) |
| 71 | EE | Béla Bollobás,
Imre Leader:
Matchings and Paths in the Cube.
Discrete Applied Mathematics 75(1): 1-8 (1997) |
| 70 | EE | Béla Bollobás,
Alex D. Scott:
Independent sets and repeated degrees.
Discrete Mathematics 170(1-3): 41-49 (1997) |
| 69 | EE | Béla Bollobás,
Norbert Hegyvári,
Guoping Jin:
On a problem of Erdös and Graham.
Discrete Mathematics 175(1-3): 253-257 (1997) |
| 68 | EE | Béla Bollobás,
Alex D. Scott:
Judicious Partitions of Hypergraphs.
J. Comb. Theory, Ser. A 78(1): 15-31 (1997) |
| 67 | EE | Béla Bollobás,
Graham Brightwell:
The Structure of Random Graph Orders.
SIAM J. Discrete Math. 10(2): 318-335 (1997) |
| 1996 |
|---|
| 66 | | Béla Bollobás,
Andrew Thomason:
Highly Linked Graphs.
Combinatorica 16(3): 313-320 (1996) |
| 65 | EE | Béla Bollobás:
Turán-Ramsey problems.
Discrete Mathematics 156(1-3): 257-262 (1996) |
| 64 | EE | Béla Bollobás:
Degree multiplicities and independent sets in K4-free graphs.
Discrete Mathematics 158(1-3): 27-35 (1996) |
| 63 | EE | Béla Bollobás,
Imre Leader:
Sums in the grid.
Discrete Mathematics 162(1-3): 31-48 (1996) |
| 62 | | Béla Bollobás,
Trevor I. Fenner,
Alan M. Frieze:
On the Best Case of Heapsort.
J. Algorithms 20(2): 205-217 (1996) |
| 61 | EE | Béla Bollobás,
Alex D. Scott:
A Proof of a Conjecture of Bondy Concerning Paths in Weighted Digraphs.
J. Comb. Theory, Ser. B 66(2): 283-292 (1996) |
| 1995 |
|---|
| 60 | | Béla Bollobás,
A. J. Radcliffe:
Defect Sauer Results.
J. Comb. Theory, Ser. A 72(2): 189-208 (1995) |
| 59 | | Béla Bollobás,
Yoshiharu Kohayakawa,
Tomasz Luczak:
Connectivity Properties of Random Subgraphs of the Cube.
Random Struct. Algorithms 6(2/3): 221-230 (1995) |
| 58 | | Béla Bollobás,
Andrew Thomason:
Generalized Chromatic Numbers of Random Graphs.
Random Struct. Algorithms 6(2/3): 353-356 (1995) |
| 1994 |
|---|
| 57 | | Béla Bollobás,
Yoshiharu Kohayakawa:
An Extension of the Erdös-Stone Theorem.
Combinatorica 14(3): 279-286 (1994) |
| 56 | EE | Béla Bollobás,
Yoshiharu Kohayakawa:
Percolation in High Dimensions.
Eur. J. Comb. 15(2): 113-125 (1994) |
| 55 | | Paul Balister,
Béla Bollobás,
Alan Stacey:
Improved Upper Bounds for the Critical Probability of Oriented Percolation in Two Dimensions.
Random Struct. Algorithms 5(4): 573-590 (1994) |
| 54 | | Béla Bollobás,
Yoshiharu Kohayakawa,
Tomasz Luczak:
On the Diameter and Radius of Random Subgraphs of the Cube.
Random Struct. Algorithms 5(5): 627-648 (1994) |
| 1993 |
|---|
| 53 | | Béla Bollobás,
Paul Erdös,
Joel Spencer,
Douglas B. West:
Clique coverings of the edges of a random graph.
Combinatorica 13(1): 1-5 (1993) |
| 52 | | Béla Bollobás,
Graham Brightwell:
Cycles through specified vertices.
Combinatorica 13(2): 147-155 (1993) |
| 51 | EE | Béla Bollobás,
Imre Leader:
Maximal sets of given diameter in the grid and the torus.
Discrete Mathematics 122(1-3): 15-35 (1993) |
| 50 | | Béla Bollobás,
István Simon:
Probabilistic Analysis of Disjoint Set Union Algorithms.
SIAM J. Comput. 22(5): 1053-1074 (1993) |
| 1992 |
|---|
| 49 | | Béla Bollobás,
Yoshiharu Kohayakawa,
Tomasz Luczak:
The Evaluation of Random Subgraphs of the Cube.
Random Struct. Algorithms 3(1): 55-90 (1992) |
| 1991 |
|---|
| 48 | | Béla Bollobás,
Bruce A. Reed,
Andrew Thomason:
An extremal function for the achromatic number.
Graph Structure Theory 1991: 161-166 |
| 47 | | Béla Bollobás,
Imre Leader:
Edge-isoperimetric inequalities in the grid.
Combinatorica 11(4): 299-314 (1991) |
| 46 | EE | Béla Bollobás,
H. R. Hind:
Graphs without large triangle free subgraphs.
Discrete Mathematics 87(2): 119-131 (1991) |
| 45 | EE | Béla Bollobás,
Imre Leader:
Compressions and isoperimetric inequalities.
J. Comb. Theory, Ser. A 56(1): 47-62 (1991) |
| 44 | EE | Béla Bollobás,
Imre Leader:
Isoperimetric inequalities and fractional set systems.
J. Comb. Theory, Ser. A 56(1): 63-74 (1991) |
| 43 | | Béla Bollobás,
Alan M. Frieze:
Spanning Maximal Planar Subgraphs of Random Graphs.
Random Struct. Algorithms 2(2): 225-232 (1991) |
| 1990 |
|---|
| 42 | EE | Béla Bollobás,
Ernest J. Cockayne,
Christina M. Mynhardt:
On generalised minimal domination parameters for paths.
Discrete Mathematics 86(1-3): 89-97 (1990) |
| 41 | EE | Béla Bollobás,
Andrei Z. Broder,
István Simon:
The Cost Distribution of Clustering in Random Probing
J. ACM 37(2): 224-237 (1990) |
| 40 | EE | Béla Bollobás,
Roland Häggkvist:
Powers of Hamilton cycles in tournaments.
J. Comb. Theory, Ser. B 50(2): 309-318 (1990) |
| 39 | | Béla Bollobás:
Complete Matchings in Random Subgraphs on the Cube.
Random Struct. Algorithms 1(1): 95-104 (1990) |
| 38 | | Béla Bollobás,
Graham Brightwell:
Parallel Selection with High Probability.
SIAM J. Discrete Math. 3(1): 21-31 (1990) |
| 37 | | Béla Bollobás,
Imre Leader:
An Isoperimetric Inequality on the Discrete Torus.
SIAM J. Discrete Math. 3(1): 32-37 (1990) |
| 1989 |
|---|
| 36 | EE | Béla Bollobás,
H. R. Hind:
A new upper bound for the list chromatic number.
Discrete Mathematics 74(1-2): 65-75 (1989) |
| 35 | EE | Noga Alon,
Béla Bollobás:
Graphs with a small number of distinct induced subgraphs.
Discrete Mathematics 75(1-3): 23-30 (1989) |
| 34 | EE | Béla Bollobás:
Paul Erdös at seventy-five.
Discrete Mathematics 75(1-3): 3-5 (1989) |
| 33 | EE | Béla Bollobás,
Graham Brightwell:
Long cycles in graphs with no subgraphs of minimal degree 3.
Discrete Mathematics 75(1-3): 47-53 (1989) |
| 32 | EE | Béla Bollobás,
Steen Rasmussen:
First cycles in random directed graph processes.
Discrete Mathematics 75(1-3): 55-68 (1989) |
| 1988 |
|---|
| 31 | | Béla Bollobás:
The chromatic number of random graphs.
Combinatorica 8(1): 49-55 (1988) |
| 30 | EE | Béla Bollobás:
Sorting in rounds.
Discrete Mathematics 72(1-3): 21-28 (1988) |
| 29 | EE | Béla Bollobás:
The number of unrelated partitions.
J. Comb. Theory, Ser. A 49(2): 389-391 (1988) |
| 28 | | Béla Bollobás,
Graham Brightwell:
Transitive Orientations of Graphs.
SIAM J. Comput. 17(6): 1119-1133 (1988) |
| 27 | | Béla Bollobás,
Fan R. K. Chung:
The Diameter of a Cycle Plus a Random Matching.
SIAM J. Discrete Math. 1(3): 328-333 (1988) |
| 1987 |
|---|
| 26 | | Béla Bollobás,
Andrew Thomason:
Threshold functions.
Combinatorica 7(1): 35-38 (1987) |
| 25 | | Béla Bollobás,
Trevor I. Fenner,
Alan M. Frieze:
An algorithm for finding Hamilton cycles in a random graph.
Combinatorica 7(4): 327-341 (1987) |
| 1986 |
|---|
| 24 | EE | Béla Bollobás,
Chie Nara,
Shun-ichi Tachibana:
The maximal number of induced complete bipartite graphs.
Discrete Mathematics 62(3): 271-275 (1986) |
| 23 | EE | Béla Bollobás,
Brendan D. McKay:
The number of matchings in random regular graphs and bipartite graphs.
J. Comb. Theory, Ser. B 41(1): 80-91 (1986) |
| 1985 |
|---|
| 22 | | Béla Bollobás,
István Simon:
On the Expected Behaviour of Disjoint Set Union Algorithms
STOC 1985: 224-231 |
| 21 | | Béla Bollobás,
Trevor I. Fenner,
Alan M. Frieze:
An Algorithm for Finding Hamilton Cycles in a Random Graph
STOC 1985: 430-439 |
| 20 | | Béla Bollobás,
István Simon:
Repeated Random Insertion into a Priority Queue.
J. Algorithms 6(4): 466-477 (1985) |
| 1984 |
|---|
| 19 | | Béla Bollobás,
Victor Klee:
Diameters of random bipartite graphs.
Combinatorica 4(1): 7-19 (1984) |
| 18 | EE | Béla Bollobás,
Ernest J. Cockayne:
The irredundance number and maximum degree of a graph.
Discrete Mathematics 49(2): 197-199 (1984) |
| 1983 |
|---|
| 17 | EE | Béla Bollobás:
Some remarks on packing trees.
Discrete Mathematics 46(2): 203-204 (1983) |
| 16 | EE | Béla Bollobás,
Richard K. Guy:
Equitable and proportional coloring of trees.
J. Comb. Theory, Ser. B 34(2): 177-186 (1983) |
| 15 | EE | Béla Bollobás,
Pierre Duchet:
On Helly families of maximal size.
J. Comb. Theory, Ser. B 35(3): 290-296 (1983) |
| 1982 |
|---|
| 14 | | Béla Bollobás,
Wenceslas Fernandez de la Vega:
The diameter of random regular graphs.
Combinatorica 2(2): 125-134 (1982) |
| 13 | | Béla Bollobás:
Long paths in sparse random graphs.
Combinatorica 2(3): 223-228 (1982) |
| 1981 |
|---|
| 12 | EE | Béla Bollobás:
Degree sequences of random graphs.
Discrete Mathematics 33(1): 1-19 (1981) |
| 11 | EE | Béla Bollobás,
Paul A. Catlin:
Topological cliques of random graphs.
J. Comb. Theory, Ser. B 30(2): 224-227 (1981) |
| 10 | EE | Béla Bollobás,
D. L. Goldsmith,
Douglas R. Woodall:
Indestructive deletions of edges from graphs.
J. Comb. Theory, Ser. B 30(3): 263-275 (1981) |
| 1980 |
|---|
| 9 | EE | Béla Bollobás:
The distribution of the maximum degree of a random graph.
Discrete Mathematics 32(2): 201-203 (1980) |
| 1979 |
|---|
| 8 | | Béla Bollobás:
Helly Families of Maximal Size.
J. Comb. Theory, Ser. A 26(2): 197-200 (1979) |
| 1978 |
|---|
| 7 | EE | Béla Bollobás:
Uniquely colorable graphs.
J. Comb. Theory, Ser. B 25(1): 54-61 (1978) |
| 6 | EE | Béla Bollobás,
Stephen E. Eldridge:
Packings of graphs and applications to computational complexity.
J. Comb. Theory, Ser. B 25(2): 105-124 (1978) |
| 5 | EE | Béla Bollobás:
The number of 1-factors in 2k-connected graphs.
J. Comb. Theory, Ser. B 25(3): 363-366 (1978) |
| 1976 |
|---|
| 4 | EE | Béla Bollobás:
Complete subgraphs are elusive.
J. Comb. Theory, Ser. B 21(1): 1-7 (1976) |
| 3 | EE | Béla Bollobás,
Paul Erdös:
On a Ramsey-Turán type problem.
J. Comb. Theory, Ser. B 21(2): 166-168 (1976) |
| 2 | EE | Béla Bollobás,
Stephen E. Eldridge:
On graphs with diameter 2.
J. Comb. Theory, Ser. B 21(3): 201-205 (1976) |
| 1973 |
|---|
| 1 | | Béla Bollobás:
Sperner Systems Consisting of Pairs of Complementary Subsets.
J. Comb. Theory, Ser. A 15(3): 363-366 (1973) |
