dblp.uni-trier.dewww.uni-trier.de

Béla Bollobás Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
190EENoga Alon, Béla Bollobás: Introduction. Combinatorics, Probability & Computing 18(1-2): 1 (2009)
189EEJózsef Balogh, Béla Bollobás, Robert Morris: Majority Bootstrap Percolation on the Hypercube. Combinatorics, Probability & Computing 18(1-2): 17-51 (2009)
188EEBéla Bollobás, Svante Janson, Oliver Riordan: Line-of-Sight Percolation. Combinatorics, Probability & Computing 18(1-2): 83-106 (2009)
187EEPaul N. Balister, Béla Bollobás, Amites Sarkar, Mark Walters: Highly connected random geometric graphs. Discrete Applied Mathematics 157(2): 309-320 (2009)
186EEJó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)
185EEJó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
184EEBéla Bollobás, Guy Kindler, Imre Leader, Ryan O'Donnell: Eliminating Cycles in the Discrete Torus. Algorithmica 50(4): 446-454 (2008)
183EEBéla Bollobás, Vladimir Nikiforov: Joints in graphs. Discrete Mathematics 308(1): 9-19 (2008)
182EEBéla Bollobás, Ervin Györi: Pentagons vs. triangles. Discrete Mathematics 308(19): 4332-4336 (2008)
181EEBéla Bollobás, Vladimir Nikiforov: Graphs and Hermitian matrices: Exact interlacing. Discrete Mathematics 308(20): 4816-4821 (2008)
180EEBéla Bollobás, András Gyárfás: Highly connected monochromatic subgraphs. Discrete Mathematics 308(9): 1722-1725 (2008)
179EEPaul N. Balister, Béla Bollobás, Amites Sarkar, Mark Walters: Connectivity of a Gaussian network. IJAHUC 3(3): 204-213 (2008)
178EEBéla Bollobás, Alexandr V. Kostochka, Kittikorn Nakprasit: Packing d-degenerate graphs. J. Comb. Theory, Ser. B 98(1): 85-94 (2008)
177EEPaul Balister, Béla Bollobás, Stefanie Gerke: Connectivity of addable graph classes. J. Comb. Theory, Ser. B 98(3): 577-584 (2008)
176EEBéla Bollobás, Oliver Riordan: Percolation on dual lattices with k-fold symmetry. Random Struct. Algorithms 32(4): 463-472 (2008)
2007
175EEPaul 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
174EEJózsef Balogh, Béla Bollobás, Robert Morris: Hereditary Properties of Tournaments. Electr. J. Comb. 14(1): (2007)
173EEBéla Bollobás, Alex D. Scott: On separating systems. Eur. J. Comb. 28(4): 1068-1071 (2007)
172EEBéla Bollobás, Oliver Riordan: A note on the Harris-Kesten Theorem. Eur. J. Comb. 28(6): 1720-1723 (2007)
171EEBéla Bollobás, Alex D. Scott: Separating systems and oriented graphs of diameter two. J. Comb. Theory, Ser. B 97(2): 193-203 (2007)
170EEBéla Bollobás, Vladimir Nikiforov: Cliques and the spectral radius. J. Comb. Theory, Ser. B 97(5): 859-865 (2007)
169EENoga 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)
168EEPaul N. Balister, Béla Bollobás, Stefanie Gerke: The generalized Randic index of trees. Journal of Graph Theory 56(4): 270-286 (2007)
167EEJó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)
166EEBéla Bollobás, Svante Janson, Oliver Riordan: The phase transition in inhomogeneous random graphs. Random Struct. Algorithms 31(1): 3-122 (2007)
165EEBéla Bollobás, Svante Janson, Oliver Riordan: Spread-out percolation in Rd. Random Struct. Algorithms 31(2): 239-246 (2007)
164EENoam 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
163EEBéla Bollobás, Guy Kindler, Imre Leader, Ryan O'Donnell: Eliminating Cycles in the Discrete Torus. LATIN 2006: 202-210
162EEBéla Bollobás, Andrew Thomason: Set colourings of graphs. Discrete Mathematics 306(10-11): 948-952 (2006)
161EEPaul N. Balister, Béla Bollobás: Pair dominating graphs. Eur. J. Comb. 27(2): 322-328 (2006)
160EEJó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)
159EEBéla Bollobás, Imre Leader: The Angel and the Devil in three dimensions. J. Comb. Theory, Ser. A 113(1): 176-184 (2006)
158EEYair 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)
157EEBéla Bollobás, Graham Brightwell: How many graphs are unions of k-cliques? Journal of Graph Theory 52(2): 87-107 (2006)
156EEBéla Bollobás, Jeong Han Kim, Jacques Verstraëte: Regular subgraphs of random graphs. Random Struct. Algorithms 29(1): 1-13 (2006)
155EEPaul 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)
154EEBéla Bollobás, Oliver Riordan: Sharp thresholds and percolation in the plane. Random Struct. Algorithms 29(4): 524-548 (2006)
153EESanjeev 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
152EERobert 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)
151EEJózsef Balogh, Béla Bollobás: Unavoidable Traces Of Set Systems. Combinatorica 25(6): 633-643 (2005)
150EEBéla Bollobás, Vladimir Nikiforov: The Sum of Degrees in Cliques. Electr. J. Comb. 12: (2005)
149EEBéla Bollobás, Vladimir Nikiforov: Books in graphs. Eur. J. Comb. 26(2): 259-270 (2005)
148EEBéla Bollobás, Oleg Pikhurko: Integer sets with prescribed pairwise differences being distinct. Eur. J. Comb. 26(5): 607-616 (2005)
147EEJó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)
146EEBé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)
145EEPaul N. Balister, Béla Bollobás, Anthony Quas: Percolation in Voronoi tilings. Random Struct. Algorithms 26(3): 310-318 (2005)
144EEPaul 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)
143EEBé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)
142EEBéla Bollobás, Don Coppersmith, Michael Elkin: Sparse Distance Preservers and Additive Spanners. SIAM J. Discrete Math. 19(4): 1029-1055 (2005)
2004
141EERobert 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
140EEBéla Bollobás, Oliver Riordan: The Phase Transition and Connectedness in Uniformly Grown Random Graphs. WAW 2004: 1-18
139EEYair Bartal, Béla Bollobás, Manor Mendel: Ramsey-type theorems for metric spaces with applications to online problems CoRR cs.DS/0406028: (2004)
138EEBéla Bollobás, Oliver Riordan: The Diameter of a Scale-Free Random Graph. Combinatorica 24(1): 5-34 (2004)
137EEBé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)
136EERichard 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)
133EEBéla Bollobás, Alex D. Scott: Max Cut for Random Graphs with a Planted Partition. Combinatorics, Probability & Computing 13(4-5): 451-474 (2004)
132EEBéla Bollobás, Vladimir Nikiforov: Hermitian matrices and graphs: singular values and discrepancy. Discrete Mathematics 285(1-3): 17-32 (2004)
131EEBéla Bollobás, Vladimir Nikiforov: Graphs and Hermitian matrices: eigenvalue interlacing. Discrete Mathematics 289(1-3): 119-127 (2004)
130EEBéla Bollobás, Vladimir Nikiforov: Degree Powers in Graphs with Forbidden Subgraphs. Electr. J. Comb. 11(1): (2004)
129EEBéla Bollobás, Peter Keevash, Benny Sudakov: Multicoloured extremal problems. J. Comb. Theory, Ser. A 107(2): 295-312 (2004)
128EEJó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)
127EERichard Arratia, Béla Bollobás, Gregory B. Sorkin: The interlace polynomial of a graph. J. Comb. Theory, Ser. B 92(2): 199-233 (2004)
126EEBéla Bollobás, Alex D. Scott: Judicious partitions of bounded-degree graphs. Journal of Graph Theory 46(2): 131-143 (2004)
2003
125EENoam Berger, Béla Bollobás, Christian Borgs, Jennifer T. Chayes, Oliver Riordan: Degree Distribution of the FKP Network Model. ICALP 2003: 725-738
124EEBéla Bollobás, Christian Borgs, Jennifer T. Chayes, Oliver Riordan: Directed scale-free graphs. SODA 2003: 132-139
123EEBéla Bollobás, Don Coppersmith, Michael Elkin: Sparse distance preservers and additive spanners. SODA 2003: 414-423
122EEBé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)
119EEBé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)
116EEBéla Bollobás, Oliver Riordan: Disjointly representing set systems. J. Comb. Theory, Ser. A 102(1): 1-9 (2003)
115EEPaul 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)
114EENoga 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)
113EEBéla Bollobás, Graham Brightwell: The number of k-SAT functions. Random Struct. Algorithms 22(3): 227-247 (2003)
112EEBéla Bollobás, Imre Leader: Union of shadows. Theor. Comput. Sci. 307(3): 493-502 (2003)
2002
111EESanjeev 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)
109EEBé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)
108EEPaul 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)
107EENoga Alon, József Balogh, Béla Bollobás, Tamás Szabó: Game domination number. Discrete Mathematics 256(1-2): 23-33 (2002)
106EEPaul Balister, Béla Bollobás, J. Cutler, Luke Pebody: The Interlace Polynomial of Graphs at - 1. Eur. J. Comb. 23(7): 761-767 (2002)
105EEBéla Bollobás: Evaluations of the Circuit Partition Polynomial. J. Comb. Theory, Ser. B 85(2): 261-268 (2002)
104EEBé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
102EEPaul 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)
101EEJó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)
99EEBé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
96EERichard Arratia, Béla Bollobás, Gregory B. Sorkin: The interlace polynomial: a new graph polynomial. SODA 2000: 237-245
95EEBé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)
93EEBéla Bollobás, Douglas B. West: A note on generalized chromatic number and generalized girth. Discrete Mathematics 213(1-3): 29-34 (2000)
92EEBéla Bollobás, Oliver Riordan: Polychromatic polynomials. Discrete Mathematics 219(1-3): 1-7 (2000)
91EEBéla Bollobás, Oliver Riordan: Constrained Graph Processes. Electr. J. Comb. 7: (2000)
90EEBéla Bollobás, Alex D. Scott: Judicious Partitions of 3-uniform Hypergraphs. Eur. J. Comb. 21(3): 289-300 (2000)
89EEBé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)
88EEJó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)
87EEBéla Bollobás, Luke Pebody, Oliver Riordan: Contraction-Deletion Invariants for Graphs. J. Comb. Theory, Ser. B 80(2): 320-345 (2000)
1999
86EEBéla Bollobás, Alex D. Scott: Exact Bounds for Judicious Partitions of Graphs. Combinatorica 19(4): 473-486 (1999)
85EEBé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)
84EEBéla Bollobás, Paul Erdös, Amites Sarkar: Extremal graphs for weights. Discrete Mathematics 200(1-3): 5-19 (1999)
83EEBéla Bollobás, Graham Brightwell, Alexander Sidorenko: Geometrical Techniques for Estimating Numbers of Linear Extensions. Eur. J. Comb. 20(5): 329-335 (1999)
82EEBéla Bollobás: Turán's Theorem and Maximal Degrees. J. Comb. Theory, Ser. B 75(1): 160-164 (1999)
81EEBé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)
78EEBéla Bollobás, Oliver Riordan: On some conjectures of Graffiti. Discrete Mathematics 179(1-3): 223-230 (1998)
77EEBéla Bollobás, Tamás Szabó: The oriented cycle game. Discrete Mathematics 186(1-3): 55-67 (1998)
76EEBé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
73EEBé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
72EEBéla Bollobás, Graham Brightwell: Random Walks and Electrical Resistances in Products of Graphs. Discrete Applied Mathematics 73(1): 69-79 (1997)
71EEBéla Bollobás, Imre Leader: Matchings and Paths in the Cube. Discrete Applied Mathematics 75(1): 1-8 (1997)
70EEBéla Bollobás, Alex D. Scott: Independent sets and repeated degrees. Discrete Mathematics 170(1-3): 41-49 (1997)
69EEBéla Bollobás, Norbert Hegyvári, Guoping Jin: On a problem of Erdös and Graham. Discrete Mathematics 175(1-3): 253-257 (1997)
68EEBéla Bollobás, Alex D. Scott: Judicious Partitions of Hypergraphs. J. Comb. Theory, Ser. A 78(1): 15-31 (1997)
67EEBé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)
65EEBéla Bollobás: Turán-Ramsey problems. Discrete Mathematics 156(1-3): 257-262 (1996)
64EEBéla Bollobás: Degree multiplicities and independent sets in K4-free graphs. Discrete Mathematics 158(1-3): 27-35 (1996)
63EEBé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)
61EEBé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)
56EEBé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)
51EEBé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)
46EEBéla Bollobás, H. R. Hind: Graphs without large triangle free subgraphs. Discrete Mathematics 87(2): 119-131 (1991)
45EEBéla Bollobás, Imre Leader: Compressions and isoperimetric inequalities. J. Comb. Theory, Ser. A 56(1): 47-62 (1991)
44EEBé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
42EEBéla Bollobás, Ernest J. Cockayne, Christina M. Mynhardt: On generalised minimal domination parameters for paths. Discrete Mathematics 86(1-3): 89-97 (1990)
41EEBéla Bollobás, Andrei Z. Broder, István Simon: The Cost Distribution of Clustering in Random Probing J. ACM 37(2): 224-237 (1990)
40EEBé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
36EEBéla Bollobás, H. R. Hind: A new upper bound for the list chromatic number. Discrete Mathematics 74(1-2): 65-75 (1989)
35EENoga Alon, Béla Bollobás: Graphs with a small number of distinct induced subgraphs. Discrete Mathematics 75(1-3): 23-30 (1989)
34EEBéla Bollobás: Paul Erdös at seventy-five. Discrete Mathematics 75(1-3): 3-5 (1989)
33EEBéla Bollobás, Graham Brightwell: Long cycles in graphs with no subgraphs of minimal degree 3. Discrete Mathematics 75(1-3): 47-53 (1989)
32EEBé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)
30EEBéla Bollobás: Sorting in rounds. Discrete Mathematics 72(1-3): 21-28 (1988)
29EEBé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
24EEBéla Bollobás, Chie Nara, Shun-ichi Tachibana: The maximal number of induced complete bipartite graphs. Discrete Mathematics 62(3): 271-275 (1986)
23EEBé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)
18EEBéla Bollobás, Ernest J. Cockayne: The irredundance number and maximum degree of a graph. Discrete Mathematics 49(2): 197-199 (1984)
1983
17EEBéla Bollobás: Some remarks on packing trees. Discrete Mathematics 46(2): 203-204 (1983)
16EEBéla Bollobás, Richard K. Guy: Equitable and proportional coloring of trees. J. Comb. Theory, Ser. B 34(2): 177-186 (1983)
15EEBé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
12EEBéla Bollobás: Degree sequences of random graphs. Discrete Mathematics 33(1): 1-19 (1981)
11EEBéla Bollobás, Paul A. Catlin: Topological cliques of random graphs. J. Comb. Theory, Ser. B 30(2): 224-227 (1981)
10EEBé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
9EEBé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
7EEBéla Bollobás: Uniquely colorable graphs. J. Comb. Theory, Ser. B 25(1): 54-61 (1978)
6EEBéla Bollobás, Stephen E. Eldridge: Packings of graphs and applications to computational complexity. J. Comb. Theory, Ser. B 25(2): 105-124 (1978)
5EEBéla Bollobás: The number of 1-factors in 2k-connected graphs. J. Comb. Theory, Ser. B 25(3): 363-366 (1978)
1976
4EEBéla Bollobás: Complete subgraphs are elusive. J. Comb. Theory, Ser. B 21(1): 1-7 (1976)
3EEBéla Bollobás, Paul Erdös: On a Ramsey-Turán type problem. J. Comb. Theory, Ser. B 21(2): 166-168 (1976)
2EEBé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

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

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)