Béla Bollobás

	2012
218		Béla Bollobás, Oliver Riordan: Asymptotic normality of the size of the giant component via a random walk. J. Comb. Theory, Ser. B 102(1): 53-61 (2012)
217		Béla Bollobás, Mykhaylo Tyomkyn: Walks and paths in trees. Journal of Graph Theory 70(1): 54-66 (2012)
	2011
216		Béla Bollobás, David Pritchard, Thomas Rothvoß, Alex D. Scott: Cover-Decomposition and Polychromatic Numbers. ESA 2011: 799-810
215		Paul Balister, Béla Bollobás, Animashree Anandkumar, Alan S. Willsky: Energy-latency tradeoff for in-network function computation in random networks. INFOCOM 2011: 1575-1583
214		Paul N. Balister, Béla Bollobás, Animashree Anandkumar, Alan S. Willsky: Energy-Latency Tradeoff for In-Network Function Computation in Random Networks CoRR abs/1101.0858: (2011)
213		Phoebus Chen, Karl Henrik Johansson, Paul Balister, Béla Bollobás, Shankar Sastry: Multi-path Routing Metrics for Reliable Wireless Mesh Routing Topologies CoRR abs/1103.5957: (2011)
212		Béla Bollobás, Imre Leader, Claudia Malvenuto: Daisies and Other Turán Problems. Combinatorics, Probability & Computing 20(5): 743-747 (2011)
211		Béla Bollobás, Vladimir Nikiforov: Large joints in graphs. Eur. J. Comb. 32(1): 33-44 (2011)
210		Béla Bollobás, Graham Brightwell, Robert Morris: Shadows of ordered graphs. J. Comb. Theory, Ser. A 118(3): 729-747 (2011)
209		József Balogh, Béla Bollobás, Miklós Simonovits: The fine structure of octahedron-free graphs. J. Comb. Theory, Ser. B 101(2): 67-84 (2011)
208		Noga Alon, József Balogh, Béla Bollobás, Robert Morris: The structure of almost all graphs in a hereditary property. J. Comb. Theory, Ser. B 101(2): 85-110 (2011)
207		Béla Bollobás, Alex D. Scott: Intersections of graphs. Journal of Graph Theory 66(4): 261-282 (2011)
206		Béla Bollobás, Svante Janson, Oliver Riordan: On covering by translates of a set. Random Struct. Algorithms 38(1-2): 33-67 (2011)
205		Béla Bollobás, Svante Janson, Oliver Riordan: Sparse random graphs with clustering. Random Struct. Algorithms 38(3): 269-323 (2011)
204		Béla Bollobás, Oliver Riordan: Sparse graphs: Metrics and random models. Random Struct. Algorithms 39(1): 1-38 (2011)
	2010
203		Noga Alon, Béla Bollobás: Introduction. Combinatorics, Probability & Computing 19(5-6): 641 (2010)
202		József Balogh, Béla Bollobás, Robert Morris: Bootstrap Percolation in High Dimensions. Combinatorics, Probability & Computing 19(5-6): 643-692 (2010)
201		Béla Bollobás, Alex D. Scott: Max k-cut and judicious k-partitions. Discrete Mathematics 310(15-16): 2126-2139 (2010)
200		Béla Bollobás, Vladimir Nikiforov: The number of graphs with large forbidden subgraphs. Eur. J. Comb. 31(8): 1964-1968 (2010)
199		Paul N. Balister, Béla Bollobás: Bond percolation with attenuation in high dimensional Voronoi tilings. Random Struct. Algorithms 36(1): 5-10 (2010)
198		Paul Balister, Béla Bollobás, J. Robert Johnson, Mark Walters: Random majority percolation. Random Struct. Algorithms 36(3): 315-340 (2010)
	2009
197		Béla Bollobás, Boris Pittel: The distribution of the root degree of a random permutation. Combinatorica 29(2): 131-151 (2009)
196		Noga Alon, Béla Bollobás: Introduction. Combinatorics, Probability & Computing 18(1-2): 1 (2009)
195		József Balogh, Béla Bollobás, Robert Morris: Majority Bootstrap Percolation on the Hypercube. Combinatorics, Probability & Computing 18(1-2): 17-51 (2009)
194		Béla Bollobás, Svante Janson, Oliver Riordan: Line-of-Sight Percolation. Combinatorics, Probability & Computing 18(1-2): 83-106 (2009)
193		Paul N. Balister, Béla Bollobás, Amites Sarkar, Mark Walters: Highly connected random geometric graphs. Discrete Applied Mathematics 157(2): 309-320 (2009)
192		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)
191		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)
190		Béla Bollobás, Oliver Riordan: Clique percolation. Random Struct. Algorithms 35(3): 294-322 (2009)
	2008
189		Béla Bollobás, Guy Kindler, Imre Leader, Ryan O'Donnell: Eliminating Cycles in the Discrete Torus. Algorithmica 50(4): 446-454 (2008)
188		Béla Bollobás, Vladimir Nikiforov: Joints in graphs. Discrete Mathematics 308(1): 9-19 (2008)
187		Béla Bollobás, Ervin Györi: Pentagons vs. triangles. Discrete Mathematics 308(19): 4332-4336 (2008)
186		Béla Bollobás, Vladimir Nikiforov: Graphs and Hermitian matrices: Exact interlacing. Discrete Mathematics 308(20): 4816-4821 (2008)
185		Béla Bollobás, András Gyárfás: Highly connected monochromatic subgraphs. Discrete Mathematics 308(9): 1722-1725 (2008)
184		Paul N. Balister, Béla Bollobás, Amites Sarkar, Mark Walters: Connectivity of a Gaussian network. IJAHUC 3(3): 204-213 (2008)
183		Béla Bollobás, Alexandr V. Kostochka, Kittikorn Nakprasit: Packing d-degenerate graphs. J. Comb. Theory, Ser. B 98(1): 85-94 (2008)
182		Paul Balister, Béla Bollobás, Stefanie Gerke: Connectivity of addable graph classes. J. Comb. Theory, Ser. B 98(3): 577-584 (2008)
181		Béla Bollobás, Oliver Riordan: Percolation on dual lattices with k-fold symmetry. Random Struct. Algorithms 32(4): 463-472 (2008)
180		Paul Balister, Béla Bollobás, Stefanie Gerke: Sequences with Changing Dependencies. SIAM J. Discrete Math. 22(3): 1149-1154 (2008)
	2007
179		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
178		József Balogh, Béla Bollobás, Robert Morris: Hereditary Properties of Tournaments. Electr. J. Comb. 14(1): (2007)
177		Béla Bollobás, Alex D. Scott: On separating systems. Eur. J. Comb. 28(4): 1068-1071 (2007)
176		Béla Bollobás, Oliver Riordan: A note on the Harris-Kesten Theorem. Eur. J. Comb. 28(6): 1720-1723 (2007)
175		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)
174		Béla Bollobás, Vladimir Nikiforov: Cliques and the spectral radius. J. Comb. Theory, Ser. B 97(5): 859-865 (2007)
173		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)
172		Paul N. Balister, Béla Bollobás, Stefanie Gerke: The generalized Randic index of trees. Journal of Graph Theory 56(4): 270-286 (2007)
171		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)
170		Béla Bollobás, Svante Janson, Oliver Riordan: The phase transition in inhomogeneous random graphs. Random Struct. Algorithms 31(1): 3-122 (2007)
169		Béla Bollobás, Svante Janson, Oliver Riordan: Spread-out percolation in Rd. Random Struct. Algorithms 31(2): 239-246 (2007)
168		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
167		Béla Bollobás, Oliver Riordan: Percolation. Cambridge University Press 2006: I-X, 1-323
166		Béla Bollobás, Guy Kindler, Imre Leader, Ryan O'Donnell: Eliminating Cycles in the Discrete Torus. LATIN 2006: 202-210
165		Béla Bollobás, Andrew Thomason: Set colourings of graphs. Discrete Mathematics 306(10-11): 948-952 (2006)
164		Paul N. Balister, Béla Bollobás: Pair dominating graphs. Eur. J. Comb. 27(2): 322-328 (2006)
163		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)
162		Béla Bollobás, Imre Leader: The Angel and the Devil in three dimensions. J. Comb. Theory, Ser. A 113(1): 176-184 (2006)
161		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)
160		Béla Bollobás, Graham Brightwell: How many graphs are unions of k-cliques? Journal of Graph Theory 52(2): 87-107 (2006)
159		Béla Bollobás, Jeong Han Kim, Jacques Verstraëte: Regular subgraphs of random graphs. Random Struct. Algorithms 29(1): 1-13 (2006)
158		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)
157		Béla Bollobás, Oliver Riordan: Sharp thresholds and percolation in the plane. Random Struct. Algorithms 29(4): 524-548 (2006)
156		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
155		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)
154		József Balogh, Béla Bollobás: Unavoidable Traces Of Set Systems. Combinatorica 25(6): 633-643 (2005)
153		Béla Bollobás, Vladimir Nikiforov: The Sum of Degrees in Cliques. Electr. J. Comb. 12: (2005)
152		Béla Bollobás, Vladimir Nikiforov: Books in graphs. Eur. J. Comb. 26(2): 259-270 (2005)
151		Béla Bollobás, Oleg Pikhurko: Integer sets with prescribed pairwise differences being distinct. Eur. J. Comb. 26(5): 607-616 (2005)
150		József Balogh, Béla Bollobás: Hereditary properties of words. ITA 39(1): 49-65 (2005)
149		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)
148		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)
147		Paul N. Balister, Béla Bollobás, Anthony Quas: Percolation in Voronoi tilings. Random Struct. Algorithms 26(3): 310-318 (2005)
146		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)
145		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)
144		Béla Bollobás, Don Coppersmith, Michael Elkin: Sparse Distance Preservers and Additive Spanners. SIAM J. Discrete Math. 19(4): 1029-1055 (2005)
	2004
143		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
142		Béla Bollobás, Oliver Riordan: The Phase Transition and Connectedness in Uniformly Grown Random Graphs. WAW 2004: 1-18
141		Yair Bartal, Béla Bollobás, Manor Mendel: Ramsey-type theorems for metric spaces with applications to online problems CoRR cs.DS/0406028: (2004)
140		Béla Bollobás, Oliver Riordan: The Diameter of a Scale-Free Random Graph. Combinatorica 24(1): 5-34 (2004)
139		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)
138		Richard Arratia, Béla Bollobás, Gregory B. Sorkin: A Two-Variable Interlace Polynomial. Combinatorica 24(4): 567-584 (2004)
137		Béla Bollobás: How Sharp is the Concentration of the Chromatic Number? Combinatorics, Probability & Computing 13(1): 115-117 (2004)
136		Béla Bollobás, Imre Leader: Isoperimetric Problems for r-sets. Combinatorics, Probability & Computing 13(2): 277-279 (2004)
135		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)
134		Béla Bollobás, Vladimir Nikiforov: Hermitian matrices and graphs: singular values and discrepancy. Discrete Mathematics 285(1-3): 17-32 (2004)
133		Béla Bollobás, Vladimir Nikiforov: Graphs and Hermitian matrices: eigenvalue interlacing. Discrete Mathematics 289(1-3): 119-127 (2004)
132		Béla Bollobás, Vladimir Nikiforov: Degree Powers in Graphs with Forbidden Subgraphs. Electr. J. Comb. 11(1): (2004)
131		Béla Bollobás, Peter Keevash, Benny Sudakov: Multicoloured extremal problems. J. Comb. Theory, Ser. A 107(2): 295-312 (2004)
130		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)
129		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)
128		Béla Bollobás, Alex D. Scott: Judicious partitions of bounded-degree graphs. Journal of Graph Theory 46(2): 131-143 (2004)
	2003
127		Noam Berger, Béla Bollobás, Christian Borgs, Jennifer T. Chayes, Oliver Riordan: Degree Distribution of the FKP Network Model. ICALP 2003: 725-738
126		Béla Bollobás, Christian Borgs, Jennifer T. Chayes, Oliver Riordan: Directed scale-free graphs. SODA 2003: 132-139
125		Béla Bollobás, Don Coppersmith, Michael Elkin: Sparse distance preservers and additive spanners. SODA 2003: 414-423
124		Béla Bollobás, Imre Leader: Set Systems with few Disjoint Pairs. Combinatorica 23(4): 559-570 (2003)
123		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)
122		Béla Bollobás, Andrew Thomason: Frank Ramsey. Combinatorics, Probability & Computing 12(5-6): 469-475 (2003)
121		Béla Bollobás, Amites Sarkar: Paths of length four. Discrete Mathematics 265(1-3): 357-363 (2003)
120		Béla Bollobás, Oliver Riordan: Robustness and Vulnerability of Scale-Free Random Graphs. Internet Mathematics 1(1): 1-35 (2003)
119		Béla Bollobás, Oliver Riordan: Coupling Scale-Free and Classical Random Graphs. Internet Mathematics 1(2): 215-225 (2003)
118		Béla Bollobás, Oliver Riordan: Disjointly representing set systems. J. Comb. Theory, Ser. A 102(1): 1-9 (2003)
117		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)
116		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)
115		Béla Bollobás, Graham Brightwell: The number of k-SAT functions. Random Struct. Algorithms 22(3): 227-247 (2003)
114		Béla Bollobás, Imre Leader: Union of shadows. Theor. Comput. Sci. 307(3): 493-502 (2003)
	2002
113		Sanjeev Arora, Béla Bollobás, László Lovász: Proving Integrality Gaps without Knowing the Linear Program. FOCS 2002: 313-322
112		József Balogh, Béla Bollobás, David Weinreich: Measures on monotone properties of graphs. Discrete Applied Mathematics 116(1-2): 17-36 (2002)
111		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)
110		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)
109		Noga Alon, József Balogh, Béla Bollobás, Tamás Szabó: Game domination number. Discrete Mathematics 256(1-2): 23-33 (2002)
108		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)
107		Béla Bollobás: Evaluations of the Circuit Partition Polynomial. J. Comb. Theory, Ser. B 85(2): 261-268 (2002)
106		Béla Bollobás, Alex D. Scott: Problems and results on judicious partitions. Random Struct. Algorithms 21(3-4): 414-430 (2002)
	2001
105		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
104		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)
103		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)
102		Béla Bollobás, Jair Donadelli, Yoshiharu Kohayakawa, Richard H. Schelp: Ramsey minimal graphs. J. Braz. Comp. Soc. 7(3): 27-37 (2001)
101		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)
100		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)
99		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
98		Richard Arratia, Béla Bollobás, Gregory B. Sorkin: The interlace polynomial: a new graph polynomial. SODA 2000: 237-245
97		Béla Bollobás, Andrew Thomason: The Structure of Hereditary Properties and Colourings of Random Graphs. Combinatorica 20(2): 173-202 (2000)
96		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)
95		Béla Bollobás, Douglas B. West: A note on generalized chromatic number and generalized girth. Discrete Mathematics 213(1-3): 29-34 (2000)
94		Béla Bollobás, Oliver Riordan: Polychromatic polynomials. Discrete Mathematics 219(1-3): 1-7 (2000)
93		Béla Bollobás, Oliver Riordan: Constrained Graph Processes. Electr. J. Comb. 7: (2000)
92		Béla Bollobás, Alex D. Scott: Judicious Partitions of 3-uniform Hypergraphs. Eur. J. Comb. 21(3): 289-300 (2000)
91		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)
90		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)
89		Béla Bollobás, Luke Pebody, Oliver Riordan: Contraction-Deletion Invariants for Graphs. J. Comb. Theory, Ser. B 80(2): 320-345 (2000)
	1999
88		Béla Bollobás, Alex D. Scott: Exact Bounds for Judicious Partitions of Graphs. Combinatorica 19(4): 473-486 (1999)
87		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)
86		Béla Bollobás, Paul Erdös, Amites Sarkar: Extremal graphs for weights. Discrete Mathematics 200(1-3): 5-19 (1999)
85		Béla Bollobás, Graham Brightwell, Alexander Sidorenko: Geometrical Techniques for Estimating Numbers of Linear Extensions. Eur. J. Comb. 20(5): 329-335 (1999)
84		Béla Bollobás: Turán's Theorem and Maximal Degrees. J. Comb. Theory, Ser. B 75(1): 160-164 (1999)
83		Béla Bollobás, Andrew Thomason: Weakly Pancyclic Graphs. J. Comb. Theory, Ser. B 77(1): 121-137 (1999)
82		Paul Balister, Béla Bollobás, Alan Stacey: Counting Boundary Paths for Oriented Percolation Clusters. Random Struct. Algorithms 14(1): 1-28 (1999)
	1998
81		Béla Bollobás, Paul Erdös: Graphs of Extremal Weights. Ars Comb. 50: (1998)
80		Béla Bollobás, Oliver Riordan: On some conjectures of Graffiti. Discrete Mathematics 179(1-3): 223-230 (1998)
79		Béla Bollobás, Tamás Szabó: The oriented cycle game. Discrete Mathematics 186(1-3): 55-67 (1998)
78		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)
77		Béla Bollobás, Oliver Riordan: Colorings generated by monotone properties. Random Struct. Algorithms 12(1): 1-25 (1998)
76		Béla Bollobás: Paul Erdös and probability theory. Random Struct. Algorithms 13(3-4): 521-533 (1998)
	1997
75		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
74		Béla Bollobás, Graham Brightwell: Random Walks and Electrical Resistances in Products of Graphs. Discrete Applied Mathematics 73(1): 69-79 (1997)
73		Béla Bollobás, Imre Leader: Matchings and Paths in the Cube. Discrete Applied Mathematics 75(1): 1-8 (1997)
72		Béla Bollobás, Alex D. Scott: Independent sets and repeated degrees. Discrete Mathematics 170(1-3): 41-49 (1997)
71		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)
70		Béla Bollobás, Alex D. Scott: Judicious Partitions of Hypergraphs. J. Comb. Theory, Ser. A 78(1): 15-31 (1997)
69		Béla Bollobás, Graham Brightwell: The Structure of Random Graph Orders. SIAM J. Discrete Math. 10(2): 318-335 (1997)
	1996
68		Béla Bollobás, Andrew Thomason: Highly Linked Graphs. Combinatorica 16(3): 313-320 (1996)
67		Béla Bollobás: Turán-Ramsey problems. Discrete Mathematics 156(1-3): 257-262 (1996)
66		Béla Bollobás: Degree multiplicities and independent sets in K4-free graphs. Discrete Mathematics 158(1-3): 27-35 (1996)
65		Béla Bollobás, Imre Leader: Sums in the grid. Discrete Mathematics 162(1-3): 31-48 (1996)
64		Béla Bollobás, Trevor I. Fenner, Alan M. Frieze: On the Best Case of Heapsort. J. Algorithms 20(2): 205-217 (1996)
63		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
62		Béla Bollobás, Yoshimi Egawa, Andrew J. Harris, Guoping Jin: The maximal number of inducedr-partite subgraphs. Graphs and Combinatorics 11(1): 1-19 (1995)
61		Béla Bollobás, A. J. Radcliffe: Defect Sauer Results. J. Comb. Theory, Ser. A 72(2): 189-208 (1995)
60		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)
59		Béla Bollobás, Andrew Thomason: Generalized Chromatic Numbers of Random Graphs. Random Struct. Algorithms 6(2/3): 353-356 (1995)
	1994
58		Béla Bollobás, Yoshiharu Kohayakawa: An Extension of the Erdös-Stone Theorem. Combinatorica 14(3): 279-286 (1994)
57		Béla Bollobás, Yoshiharu Kohayakawa: Percolation in High Dimensions. Eur. J. Comb. 15(2): 113-125 (1994)
56		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)
55		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
54		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)
53		Béla Bollobás, Graham Brightwell: Cycles through specified vertices. Combinatorica 13(2): 147-155 (1993)
52		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)
51		Béla Bollobás, István Simon: Probabilistic Analysis of Disjoint Set Union Algorithms. SIAM J. Comput. 22(5): 1053-1074 (1993)
	1992
50		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
49		Béla Bollobás, Bruce A. Reed, Andrew Thomason: An extremal function for the achromatic number. Graph Structure Theory 1991: 161-166
48		Béla Bollobás, Imre Leader: Edge-isoperimetric inequalities in the grid. Combinatorica 11(4): 299-314 (1991)
47		Béla Bollobás, H. R. Hind: Graphs without large triangle free subgraphs. Discrete Mathematics 87(2): 119-131 (1991)
46		Béla Bollobás, Imre Leader: Compressions and isoperimetric inequalities. J. Comb. Theory, Ser. A 56(1): 47-62 (1991)
45		Béla Bollobás, Imre Leader: Isoperimetric inequalities and fractional set systems. J. Comb. Theory, Ser. A 56(1): 63-74 (1991)
44		Béla Bollobás, Alan M. Frieze: Spanning Maximal Planar Subgraphs of Random Graphs. Random Struct. Algorithms 2(2): 225-232 (1991)
	1990
43		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)
42		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)
41		Béla Bollobás, Roland Häggkvist: Powers of Hamilton cycles in tournaments. J. Comb. Theory, Ser. B 50(2): 309-318 (1990)
40		Béla Bollobás: Complete Matchings in Random Subgraphs on the Cube. Random Struct. Algorithms 1(1): 95-104 (1990)
39		Béla Bollobás, Graham Brightwell: Parallel Selection with High Probability. SIAM J. Discrete Math. 3(1): 21-31 (1990)
38		Béla Bollobás, Imre Leader: An Isoperimetric Inequality on the Discrete Torus. SIAM J. Discrete Math. 3(1): 32-37 (1990)
	1989
37		Béla Bollobás, H. R. Hind: A new upper bound for the list chromatic number. Discrete Mathematics 74(1-2): 65-75 (1989)
36		Noga Alon, Béla Bollobás: Graphs with a small number of distinct induced subgraphs. Discrete Mathematics 75(1-3): 23-30 (1989)
35		Béla Bollobás: Paul Erdös at seventy-five. Discrete Mathematics 75(1-3): 3-5 (1989)
34		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)
33		Béla Bollobás, Steen Rasmussen: First cycles in random directed graph processes. Discrete Mathematics 75(1-3): 55-68 (1989)
	1988
32		Béla Bollobás: The chromatic number of random graphs. Combinatorica 8(1): 49-55 (1988)
31		Béla Bollobás: Sorting in rounds. Discrete Mathematics 72(1-3): 21-28 (1988)
30		Béla Bollobás: The number of unrelated partitions. J. Comb. Theory, Ser. A 49(2): 389-391 (1988)
29		Béla Bollobás, Graham Brightwell: Transitive Orientations of Graphs. SIAM J. Comput. 17(6): 1119-1133 (1988)
28		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
27		Béla Bollobás, Andrew Thomason: Threshold functions. Combinatorica 7(1): 35-38 (1987)
26		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
25		Béla Bollobás, Chie Nara, Shun-ichi Tachibana: The maximal number of induced complete bipartite graphs. Discrete Mathematics 62(3): 271-275 (1986)
24		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
23		Béla Bollobás, István Simon: On the Expected Behaviour of Disjoint Set Union Algorithms STOC 1985: 224-231
22		Béla Bollobás, Trevor I. Fenner, Alan M. Frieze: An Algorithm for Finding Hamilton Cycles in a Random Graph STOC 1985: 430-439
21		Béla Bollobás, Andrew J. Harris: List-colourings of graphs. Graphs and Combinatorics 1(1): 115-127 (1985)
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		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		Béla Bollobás: Some remarks on packing trees. Discrete Mathematics 46(2): 203-204 (1983)
16		Béla Bollobás, Richard K. Guy: Equitable and proportional coloring of trees. J. Comb. Theory, Ser. B 34(2): 177-186 (1983)
15		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		Béla Bollobás: Degree sequences of random graphs. Discrete Mathematics 33(1): 1-19 (1981)
11		Béla Bollobás, Paul A. Catlin: Topological cliques of random graphs. J. Comb. Theory, Ser. B 30(2): 224-227 (1981)
10		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		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		Béla Bollobás: Uniquely colorable graphs. J. Comb. Theory, Ser. B 25(1): 54-61 (1978)
6		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		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		Béla Bollobás: Complete subgraphs are elusive. J. Comb. Theory, Ser. B 21(1): 1-7 (1976)
3		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		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)

Coauthor Index

1	Noga Alon	[36] [109] [116] [173] [196] [203] [208]
2	Animashree Anandkumar	[214] [215]
3	Sanjeev Arora	[113] [156]
4	Richard Arratia	[96] [98] [129] [138]
5	Paul N. Balister (Paul Balister)	[56] [82] [104] [108] [110] [117] [143] [146] [147] [155] [158] [164] [172] [179] [180] [182] [184] [193] [198] [199] [213] [214] [215]
6	József Balogh	[90] [103] [109] [112] [130] [149] [150] [154] [163] [171] [178] [191] [192] [195] [202] [208] [209]
7	Yair Bartal	[105] [141] [161]
8	Noam Berger	[127] [168]
9	Christian Borgs	[100] [126] [127] [168]
10	Graham Brightwell	[29] [34] [39] [53] [69] [74] [85] [115] [123] [160] [210]
11	Andrei Z. Broder	[42]
12	Paul A. Catlin	[11]
13	Jennifer T. Chayes	[100] [126] [127] [168]
14	Phoebus Chen	[213]
15	Fan R. K. Chung (Fan Chung Graham)	[28]
16	Ernest J. Cockayne	[18] [43]
17	Don Coppersmith	[96] [125] [144]
18	J. Cutler	[108]
19	Gautam Das	[75] [101]
20	Jair Donadelli	[102]
21	Pierre Duchet	[15]
22	Yoshimi Egawa	[62]
23	Stephen E. Eldridge	[2] [6]
24	Michael Elkin	[125] [144]
25	Paul Erdös	[3] [54] [81] [86] [111]
26	Ralph J. Faudree	[111]
27	Trevor I. Fenner	[22] [26] [64]
28	Walter J. Freeman	[143] [155]
29	Alan M. Frieze	[22] [26] [44] [64]
30	David Gamarnik	[139]
31	Stefanie Gerke	[172] [180] [182]
32	D. L. Goldsmith	[10]
33	Dimitrios Gunopulos	[75] [101]
34	Richard K. Guy	[16]
35	András Gyárfás	[173] [185]
36	Ervin Györi	[187]
37	Roland Häggkvist	[41]
38	Andrew J. Harris	[21] [62]
39	Norbert Hegyvári	[71]
40	H. R. Hind	[37] [47]
41	Svante Janson	[148] [169] [170] [194] [205] [206]
42	Guoping Jin	[62] [71]
43	Karl Henrik Johansson	[213]
44	J. Robert Johnson	[198]
45	Peter Keevash	[131]
46	Jeong Han Kim	[100] [159]
47	Guy Kindler	[166] [189]
48	Victor Klee	[19]
49	Yoshiharu Kohayakawa	[50] [55] [57] [58] [60] [102] [123]
50	Alexandr V. Kostochka	[91] [183]
51	Robert Kozma (Robert B. Kozma)	[143] [155] [158]
52	Michael Krivelevich	[116]
53	Santosh Kumar	[179]
54	Imre Leader	[38] [45] [46] [48] [52] [65] [73] [114] [123] [124] [136] [162] [166] [189] [212]
55	Jenö Lehel (Jeno Lehel)	[173]
56	László Lovász	[113] [156]
57	Tomasz Luczak	[50] [55] [60]
58	Claudia Malvenuto	[212]
59	Heikki Mannila	[75] [101]
60	Brendan D. McKay	[24]
61	Manor Mendel	[105] [141] [161]
62	Robert Morris	[163] [171] [178] [195] [202] [208] [210]
63	Christina M. Mynhardt	[43]
64	Kittikorn Nakprasit	[183]
65	Chie Nara	[25]
66	Vladimir Nikiforov	[132] [133] [134] [152] [153] [174] [186] [188] [200] [211]
67	Ryan O'Donnell	[166] [189]
68	Luke Pebody	[89] [108]
69	Oleg Pikhurko	[151]
70	Boris Pittel	[197]
71	David Pritchard	[216]
72	Marko Puljic	[143] [155]
73	Anthony Quas	[147]
74	A. J. Radcliffe	[61]
75	Steen Rasmussen	[33]
76	Bruce A. Reed	[49]
77	Oliver Riordan	[77] [80] [87] [89] [93] [94] [99] [104] [117] [118] [119] [120] [126] [127] [139] [140] [142] [145] [148] [157] [167] [168] [169] [170] [176] [181] [190] [194] [204] [205] [206] [218]
78	Thomas Rothvoß	[216]
79	Cecil C. Rousseau	[111]
80	Zdenek Ryjácek	[87]
81	Akira Saito	[87]
82	Michael E. Saks (Michael Saks)	[192]
83	Amites Sarkar	[86] [121] [179] [184] [193]
84	Shankar Sastry (Shankar S. Sastry)	[213]
85	Richard H. Schelp	[87] [91] [102] [110] [111] [117]
86	Alex D. Scott (Alexander D. Scott)	[63] [70] [72] [88] [92] [104] [106] [123] [128] [135] [173] [175] [177] [201] [207] [216]
87	Alexander Sidorenko	[85]
88	István Simon	[20] [23] [42] [51]
89	Miklós Simonovits	[130] [191] [209]
90	Gregory B. Sorkin	[96] [98] [129] [138]
91	Vera T. Sós	[192]
92	Joel H. Spencer (Joel Spencer)	[54] [99]
93	Alan Stacey	[56] [82]
94	Benny Sudakov	[116] [131] [139]
95	Tamás Szabó	[79] [109]
96	Shun-ichi Tachibana	[25]
97	Andrew Thomason	[27] [49] [59] [68] [78] [83] [97] [122] [165]
98	Iannis Tourlakis	[156]
99	Gábor E. Tusnády	[99]
100	Mykhaylo Tyomkyn	[217]
101	Wenceslas Fernandez de la Vega	[14]
102	Jacques Verstraëte	[159]
103	Mark Walters	[146] [184] [193] [198]
104	David Weinreich	[90] [103] [112] [149]
105	Douglas B. West	[54] [95]
106	Alan S. Willsky	[214] [215]
107	David Bruce Wilson	[100]
108	Douglas R. Woodall	[10]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page