default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBéla Bollobás
Person information
- affiliation: University of Cambridge, UK
- award (2017): Széchenyi Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j272]Paul Balister, Béla Bollobás, Robert Morris
, Paul Smith:
Subcritical monotone cellular automata. Random Struct. Algorithms 64(1): 38-61 (2024)- 2021
- [j271]József Balogh, Béla Bollobás, Bhargav P. Narayanan:
Counting independent sets in regular hypergraphs. J. Comb. Theory A 180: 105405 (2021) - 2020
- [j270]Béla Bollobás, Simon Griffiths, Robert Morris, Leonardo T. Rolla, Paul Smith:
Nucleation and growth in two dimensions. Random Struct. Algorithms 56(1): 63-96 (2020)
2010 – 2019
- 2019
- [j269]Paul Balister, Béla Bollobás, Julian Sahasrabudhe, Alexander Veremyev:
Dense subgraphs in random graphs. Discret. Appl. Math. 260: 66-74 (2019) - 2018
- [j268]Paul Balister, Béla Bollobás, Imre Leader, Robert Morris:
Introduction. Comb. Probab. Comput. 27(4): 441 (2018) - [j267]Béla Bollobás, Shoham Letzter:
Longest common extension. Eur. J. Comb. 68: 242-248 (2018) - [j266]Béla Bollobás, Jonathan Lee, Shoham Letzter:
Eigenvalues of subgraphs of the cube. Eur. J. Comb. 70: 125-148 (2018) - [j265]Paul Balister, Béla Bollobás, Jonathan Lee, Bhargav P. Narayanan:
Line percolation. Random Struct. Algorithms 52(4): 597-616 (2018) - [j264]Béla Bollobás, Oliver Riordan:
Counting dense connected hypergraphs via the probabilistic method. Random Struct. Algorithms 53(2): 185-220 (2018) - [c18]Béla Bollobás:
Making Squares - Sieves, Smooth Numbers, Cores and Random Xorsat (Keynote Speakers). AofA 2018: 3:1-3:1 - 2017
- [j263]Béla Bollobás, Michal Przykucki, Oliver Riordan, Julian Sahasrabudhe:
On the Maximum Running Time in Graph Bootstrap Percolation. Electron. J. Comb. 24(2): 2 (2017) - [j262]Béla Bollobás, Oliver Riordan, Erik Slivken, Paul Smith:
The Threshold for Jigsaw Percolation on Random Graphs. Electron. J. Comb. 24(2): 2 (2017) - [j261]Paul Balister, Béla Bollobás, Martin Haenggi, Amites Sarkar, Mark Walters:
Sentry selection in sensor networks: theory and algorithms. Int. J. Sens. Networks 24(3): 139-148 (2017) - [j260]Béla Bollobás, Oliver Cooley, Mihyun Kang, Christoph Koch:
Jigsaw percolation on random hypergraphs. J. Appl. Probab. 54(4): 1261-1277 (2017) - [j259]Paul Balister, Amy Shaw, Béla Bollobás, Bhargav P. Narayanan:
Catching a fast robber on the grid. J. Comb. Theory A 152: 341-352 (2017) - [j258]Béla Bollobás, Oliver Riordan:
Exploring hypergraphs with martingales. Random Struct. Algorithms 50(3): 325-352 (2017) - [j257]Béla Bollobás, Svante Janson, Alex Scott:
Packing random graphs and hypergraphs. Random Struct. Algorithms 51(1): 3-13 (2017) - 2016
- [j256]Béla Bollobás, Oliver Riordan:
Counting Connected Hypergraphs via the Probabilistic Method. Comb. Probab. Comput. 25(1): 21-75 (2016) - [j255]Paul Balister, Béla Bollobás, Karen Gunderson:
Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs. Eur. J. Comb. 57: 85-93 (2016) - [j254]Béla Bollobás, Bhargav P. Narayanan, Andrei M. Raigorodskii:
On the stability of the Erdős-Ko-Rado theorem. J. Comb. Theory A 137: 64-78 (2016) - [j253]Paul Balister, Béla Bollobás, Amites Sarkar:
Barrier Coverage. Random Struct. Algorithms 49(3): 429-478 (2016) - [j252]Paul N. Balister, Béla Bollobás, Jenö Lehel, Michal Morayne:
Random Hypergraph Irregularity. SIAM J. Discret. Math. 30(1): 465-473 (2016) - [i4]Paul Balister, Scott Binski, Béla Bollobás, Bhargav P. Narayanan:
Catching a fast robber on the grid. CoRR abs/1609.01002 (2016) - 2015
- [j251]Béla Bollobás, Paul Smith, Andrew J. Uzzell:
Monotone Cellular Automata in a Random Environment. Comb. Probab. Comput. 24(4): 687-722 (2015) - [j250]Béla Bollobás, Tom Eccles:
Partial Shadows of Set Systems. Comb. Probab. Comput. 24(5): 825-828 (2015) - [j249]Béla Bollobás, Alex D. Scott:
Intersections of random hypergraphs and tournaments. Eur. J. Comb. 44: 125-139 (2015) - [j248]Béla Bollobás, Teeradej Kittipassorn, Bhargav P. Narayanan, Alexander D. Scott:
Disjoint induced subgraphs of the same order and size. Eur. J. Comb. 49: 153-166 (2015) - [j247]Béla Bollobás, Alex D. Scott:
Intersections of hypergraphs. J. Comb. Theory B 110: 180-208 (2015) - [j246]Béla Bollobás, Oliver Riordan:
An old approach to the giant component problem. J. Comb. Theory B 113: 236-260 (2015) - [j245]Béla Bollobás, Paul Smith, Andrew J. Uzzell:
The time of bootstrap percolation with dense initial sets for all thresholds. Random Struct. Algorithms 47(1): 1-29 (2015) - 2014
- [j244]Paul Balister, Béla Bollobás:
Interference percolation. Random Struct. Algorithms 44(4): 399-418 (2014) - [p5]Béla Bollobás, Zoltán Füredi, Ida Kantor, Gyula O. H. Katona, Imre Leader:
A coding problem for pairs of subsets. Geometry, Structure and Randomness in Combinatorics 2014: 47-59 - 2013
- [j243]Béla Bollobás, Dieter Mitsche, Pawel Pralat:
Metric Dimension for Random Graphs. Electron. J. Comb. 20(4): 1 (2013) - [j242]Béla Bollobás, Gábor Kun, Imre Leader:
Cops and robbers in a random graph. J. Comb. Theory B 103(2): 226-236 (2013) - [j241]Igor Balla, Béla Bollobás, Tom Eccles:
Union-closed families of sets. J. Comb. Theory A 120(3): 531-544 (2013) - [j240]Béla Bollobás, Malte Lackmann, Dierk Schleicher:
A small probabilistic universal set of starting points for finding roots of complex polynomials by Newton's method. Math. Comput. 82(281): 443-457 (2013) - [j239]Paul Balister, Béla Bollobás, Jenö Lehel, Michal Morayne:
Repeated Degrees in Random Uniform Hypergraphs. SIAM J. Discret. Math. 27(1): 145-154 (2013) - [j238]Béla Bollobás, David Pritchard, Thomas Rothvoß, Alex D. Scott:
Cover-Decomposition and Polychromatic Numbers. SIAM J. Discret. Math. 27(1): 240-256 (2013) - [p4]Béla Bollobás:
Paul Erdős: Life and Work. The Mathematics of Paul Erdős I 2013: 1-41 - [p3]Béla Bollobás, Graham R. Brightwell:
The Dimension of Random Graph Orders. The Mathematics of Paul Erdős II 2013: 47-68 - [p2]Béla Bollobás, Andrew Thomason:
Hereditary and Monotone Properties of Graphs. The Mathematics of Paul Erdős II 2013: 69-80 - 2012
- [j237]Paul Balister, Béla Bollobás:
Projections, entropy and sumsets. Comb. 32(2): 125-141 (2012) - [j236]Béla Bollobás, Oliver Riordan:
A Simple Branching Process Approach to the Phase Transition in Gn, p. Electron. J. Comb. 19(4): 21 (2012) - [j235]Paul Balister, Béla Bollobás:
Critical Probabilities of 1-Independent Percolation Models. Comb. Probab. Comput. 21(1-2): 11-22 (2012) - [j234]Béla Bollobás, Vladimir Nikiforov:
Degree Powers in Graphs: The Erdős-Stone Theorem. Comb. Probab. Comput. 21(1-2): 89-105 (2012) - [j233]Béla Bollobás, Svante Janson, Oliver Riordan:
Monotone Graph Limits and Quasimonotone Graphs. Internet Math. 8(3): 187-231 (2012) - [j232]Béla Bollobás, Oliver Riordan:
Asymptotic normality of the size of the giant component via a random walk. J. Comb. Theory B 102(1): 53-61 (2012) - [j231]József Balogh, Béla Bollobás, Robert Morris, Oliver Riordan:
Linear algebra and bootstrap percolation. J. Comb. Theory A 119(6): 1328-1335 (2012) - [j230]Béla Bollobás, Mykhaylo Tyomkyn:
Walks and paths in trees. J. Graph Theory 70(1): 54-66 (2012) - [j229]József Balogh, Béla Bollobás, Robert Morris:
Graph bootstrap percolation. Random Struct. Algorithms 41(4): 413-440 (2012) - [j228]Béla Bollobás, Oliver Riordan:
Asymptotic normality of the size of the giant component in a random hypergraph. Random Struct. Algorithms 41(4): 441-450 (2012) - [j227]József Balogh, Tom Bohman, Béla Bollobás, Yi Zhao:
Turán Densities of Some Hypergraphs Related to Kk+1k. SIAM J. Discret. Math. 26(4): 1609-1617 (2012) - 2011
- [b5]Béla Bollobás:
Random Graphs, Second Edition. Cambridge Studies in Advanced Mathematics 73, Cambridge University Press 2011, ISBN 978-0-51181406-8, pp. 1-498 - [j226]Béla Bollobás, Imre Leader, Claudia Malvenuto:
Daisies and Other Turán Problems. Comb. Probab. Comput. 20(5): 743-747 (2011) - [j225]Béla Bollobás, Vladimir Nikiforov:
Large joints in graphs. Eur. J. Comb. 32(1): 33-44 (2011) - [j224]József Balogh, Béla Bollobás, Miklós Simonovits:
The fine structure of octahedron-free graphs. J. Comb. Theory B 101(2): 67-84 (2011) - [j223]Noga Alon, József Balogh, Béla Bollobás, Robert Morris:
The structure of almost all graphs in a hereditary property. J. Comb. Theory B 101(2): 85-110 (2011) - [j222]Béla Bollobás, Graham R. Brightwell, Robert Morris:
Shadows of ordered graphs. J. Comb. Theory A 118(3): 729-747 (2011) - [j221]Béla Bollobás, Alex D. Scott:
Intersections of graphs. J. Graph Theory 66(4): 261-282 (2011) - [j220]Béla Bollobás, Svante Janson, Oliver Riordan:
On covering by translates of a set. Random Struct. Algorithms 38(1-2): 33-67 (2011) - [j219]Béla Bollobás, Svante Janson, Oliver Riordan:
Sparse random graphs with clustering. Random Struct. Algorithms 38(3): 269-323 (2011) - [j218]Béla Bollobás, Oliver Riordan:
Sparse graphs: Metrics and random models. Random Struct. Algorithms 39(1): 1-38 (2011) - [c17]Béla Bollobás, David Pritchard, Thomas Rothvoß, Alex D. Scott:
Cover-Decomposition and Polychromatic Numbers. ESA 2011: 799-810 - [c16]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 - [i3]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) - [i2]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) - 2010
- [j217]Noga Alon, Béla Bollobás:
Introduction. Comb. Probab. Comput. 19(5-6): 641 (2010) - [j216]József Balogh, Béla Bollobás, Robert Morris:
Bootstrap Percolation in High Dimensions. Comb. Probab. Comput. 19(5-6): 643-692 (2010) - [j215]Béla Bollobás, Alex D. Scott:
Max k-cut and judicious k-partitions. Discret. Math. 310(15-16): 2126-2139 (2010) - [j214]Béla Bollobás, Vladimir Nikiforov:
The number of graphs with large forbidden subgraphs. Eur. J. Comb. 31(8): 1964-1968 (2010) - [j213]Paul N. Balister, Béla Bollobás:
Bond percolation with attenuation in high dimensional Voronoi tilings. Random Struct. Algorithms 36(1): 5-10 (2010) - [j212]Paul Balister, Béla Bollobás, J. Robert Johnson, Mark Walters:
Random majority percolation. Random Struct. Algorithms 36(3): 315-340 (2010)
2000 – 2009
- 2009
- [j211]Béla Bollobás, Boris G. Pittel:
The distribution of the root degree of a random permutation. Comb. 29(2): 131-151 (2009) - [j210]Noga Alon, Béla Bollobás:
Introduction. Comb. Probab. Comput. 18(1-2): 1 (2009) - [j209]József Balogh, Béla Bollobás, Robert Morris:
Majority Bootstrap Percolation on the Hypercube. Comb. Probab. Comput. 18(1-2): 17-51 (2009) - [j208]Béla Bollobás, Svante Janson, Oliver Riordan:
Line-of-Sight Percolation. Comb. Probab. Comput. 18(1-2): 83-106 (2009) - [j207]Paul N. Balister, Béla Bollobás, Amites Sarkar, Mark Walters:
Highly connected random geometric graphs. Discret. Appl. Math. 157(2): 309-320 (2009) - [j206]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 B 99(1): 9-19 (2009) - [j205]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) - [j204]Béla Bollobás, Oliver Riordan:
Clique percolation. Random Struct. Algorithms 35(3): 294-322 (2009) - 2008
- [j203]Béla Bollobás, Guy Kindler, Imre Leader, Ryan O'Donnell:
Eliminating Cycles in the Discrete Torus. Algorithmica 50(4): 446-454 (2008) - [j202]Béla Bollobás, Vladimir Nikiforov:
Joints in graphs. Discret. Math. 308(1): 9-19 (2008) - [j201]Béla Bollobás, András Gyárfás:
Highly connected monochromatic subgraphs. Discret. Math. 308(9): 1722-1725 (2008) - [j200]Béla Bollobás, Ervin Györi:
Pentagons vs. triangles. Discret. Math. 308(19): 4332-4336 (2008) - [j199]Béla Bollobás, Vladimir Nikiforov:
Graphs and Hermitian matrices: Exact interlacing. Discret. Math. 308(20): 4816-4821 (2008) - [j198]Paul N. Balister, Béla Bollobás, Amites Sarkar, Mark Walters:
Connectivity of a Gaussian network. Int. J. Ad Hoc Ubiquitous Comput. 3(3): 204-213 (2008) - [j197]Béla Bollobás, Alexandr V. Kostochka, Kittikorn Nakprasit:
Packing d-degenerate graphs. J. Comb. Theory B 98(1): 85-94 (2008) - [j196]Paul Balister, Béla Bollobás, Stefanie Gerke:
Connectivity of addable graph classes. J. Comb. Theory B 98(3): 577-584 (2008) - [j195]Béla Bollobás, Oliver Riordan:
Percolation on dual lattices with k-fold symmetry. Random Struct. Algorithms 32(4): 463-472 (2008) - [j194]Paul Balister, Béla Bollobás, Stefanie Gerke:
Sequences with Changing Dependencies. SIAM J. Discret. Math. 22(3): 1149-1154 (2008) - 2007
- [j193]József Balogh, Béla Bollobás, Robert Morris:
Hereditary Properties of Tournaments. Electron. J. Comb. 14(1) (2007) - [j192]Béla Bollobás, Alex D. Scott:
On separating systems. Eur. J. Comb. 28(4): 1068-1071 (2007) - [j191]Béla Bollobás, Oliver Riordan:
A note on the Harris-Kesten Theorem. Eur. J. Comb. 28(6): 1720-1723 (2007) - [j190]Béla Bollobás, Alex D. Scott:
Separating systems and oriented graphs of diameter two. J. Comb. Theory B 97(2): 193-203 (2007) - [j189]Béla Bollobás, Vladimir Nikiforov:
Cliques and the spectral radius. J. Comb. Theory B 97(5): 859-865 (2007) - [j188]Noga Alon, Béla Bollobás, András Gyárfás, Jenö Lehel, Alex D. Scott:
Maximum directed cuts in acyclic digraphs. J. Graph Theory 55(1): 1-13 (2007) - [j187]Paul N. Balister, Béla Bollobás, Stefanie Gerke:
The generalized Randic index of trees. J. Graph Theory 56(4): 270-286 (2007) - [j186]József Balogh, Béla Bollobás, Robert Morris:
Hereditary properties of combinatorial structures: Posets and oriented graphs. J. Graph Theory 56(4): 311-332 (2007) - [j185]Béla Bollobás, Svante Janson, Oliver Riordan:
The phase transition in inhomogeneous random graphs. Random Struct. Algorithms 31(1): 3-122 (2007) - [j184]Béla Bollobás, Svante Janson, Oliver Riordan:
Spread-out percolation in Rd. Random Struct. Algorithms 31(2): 239-246 (2007) - [j183]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) - [c15]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 - 2006
- [b4]Béla Bollobás, Oliver Riordan:
Percolation. Cambridge University Press 2006, ISBN 978-0-521-87232-4, pp. I-X, 1-323 - [b3]Béla Bollobás:
The Art of Mathematics - Coffee Time in Memphis. Cambridge University Press 2006, ISBN 978-0-521-69395-0, pp. I-XIV, 1-370 - [j182]Béla Bollobás, Andrew Thomason:
Set colourings of graphs. Discret. Math. 306(10-11): 948-952 (2006) - [j181]Paul N. Balister, Béla Bollobás:
Pair dominating graphs. Eur. J. Comb. 27(2): 322-328 (2006) - [j180]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) - [j179]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) - [j178]Béla Bollobás, Imre Leader:
The Angel and the Devil in three dimensions. J. Comb. Theory A 113(1): 176-184 (2006) - [j177]Béla Bollobás, Graham R. Brightwell:
How many graphs are unions of k-cliques? J. Graph Theory 52(2): 87-107 (2006) - [j176]Béla Bollobás, Jeong Han Kim, Jacques Verstraëte:
Regular subgraphs of random graphs. Random Struct. Algorithms 29(1): 1-13 (2006) - [j175]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) - [j174]Béla Bollobás, Oliver Riordan:
Sharp thresholds and percolation in the plane. Random Struct. Algorithms 29(4): 524-548 (2006) - [j173]Sanjeev Arora, Béla Bollobás, László Lovász, Iannis Tourlakis:
Proving Integrality Gaps without Knowing the Linear Program. Theory Comput. 2(2): 19-51 (2006) - [c14]Béla Bollobás, Guy Kindler, Imre Leader, Ryan O'Donnell:
Eliminating Cycles in the Discrete Torus. LATIN 2006: 202-210 - 2005
- [j172]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. Biol. Cybern. 92(6): 367-379 (2005) - [j171]József Balogh, Béla Bollobás:
Unavoidable Traces Of Set Systems. Comb. 25(6): 633-643 (2005) - [j170]Béla Bollobás, Vladimir Nikiforov:
The Sum of Degrees in Cliques. Electron. J. Comb. 12 (2005) - [j169]Béla Bollobás, Vladimir Nikiforov:
Books in graphs. Eur. J. Comb. 26(2): 259-270 (2005) - [j168]Béla Bollobás, Oleg Pikhurko:
Integer sets with prescribed pairwise differences being distinct. Eur. J. Comb. 26(5): 607-616 (2005) - [j167]József Balogh, Béla Bollobás:
Hereditary properties of words. RAIRO Theor. Informatics Appl. 39(1): 49-65 (2005) - [j166]József Balogh, Béla Bollobás, David Weinreich:
A jump to the bell number for hereditary graph properties. J. Comb. Theory B 95(1): 29-48 (2005) - [j165]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) - [j164]Paul N. Balister, Béla Bollobás, Anthony Quas:
Percolation in Voronoi tilings. Random Struct. Algorithms 26(3): 310-318 (2005) - [j163]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) - [j162]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) - [j161]Béla Bollobás, Don Coppersmith, Michael Elkin:
Sparse Distance Preservers and Additive Spanners. SIAM J. Discret. Math. 19(4): 1029-1055 (2005) - 2004
- [j160]Béla Bollobás, Oliver Riordan:
The Diameter of a Scale-Free Random Graph. Comb. 24(1): 5-34 (2004) - [j159]Béla Bollobás, David Gamarnik, Oliver Riordan, Benny Sudakov:
On the Value of a Random Minimum Weight Steiner Tree. Comb. 24(2): 187-207 (2004) - [j158]Richard Arratia, Béla Bollobás, Gregory B. Sorkin:
A Two-Variable Interlace Polynomial. Comb. 24(4): 567-584 (2004) - [j157]Béla Bollobás, Vladimir Nikiforov:
Degree Powers in Graphs with Forbidden Subgraphs. Electron. J. Comb. 11(1) (2004) - [j156]Béla Bollobás:
How Sharp is the Concentration of the Chromatic Number? Comb. Probab. Comput. 13(1): 115-117 (2004) - [j155]Béla Bollobás, Imre Leader:
Isoperimetric Problems for r-sets. Comb. Probab. Comput. 13(2): 277-279 (2004) - [j154]Béla Bollobás, Alex D. Scott:
Max Cut for Random Graphs with a Planted Partition. Comb. Probab. Comput. 13(4-5): 451-474 (2004) - [j153]Béla Bollobás, Vladimir Nikiforov:
Hermitian matrices and graphs: singular values and discrepancy. Discret. Math. 285(1-3): 17-32 (2004) - [j152]Béla Bollobás, Vladimir Nikiforov:
Graphs and Hermitian matrices: eigenvalue interlacing. Discret. Math. 289(1-3): 119-127 (2004) - [j151]József Balogh, Béla Bollobás, Miklós Simonovits:
The number of graphs without forbidden subgraphs. J. Comb. Theory B 91(1): 1-24 (2004) - [j150]Richard Arratia, Béla Bollobás, Gregory B. Sorkin:
The interlace polynomial of a graph. J. Comb. Theory B 92(2): 199-233 (2004) - [j149]Béla Bollobás, Peter Keevash, Benny Sudakov:
Multicoloured extremal problems. J. Comb. Theory A 107(2): 295-312 (2004) - [j148]Béla Bollobás, Alex D. Scott:
Judicious partitions of bounded-degree graphs. J. Graph Theory 46(2): 131-143 (2004) - [c13]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 - [c12]Paul Balister, Béla Bollobás, Martin Haenggi, Mark Walters:
Fast transmission in ad hoc networks. ISIT 2004: 19 - [c11]Béla Bollobás, Oliver Riordan:
The Phase Transition and Connectedness in Uniformly Grown Random Graphs. WAW 2004: 1-18 - [i1]Yair Bartal, Béla Bollobás, Manor Mendel:
Ramsey-type theorems for metric spaces with applications to online problems. CoRR cs.DS/0406028 (2004) - 2003
- [j147]Béla Bollobás, Imre Leader:
Set Systems with few Disjoint Pairs. Comb. 23(4): 559-570 (2003) - [j146]Béla Bollobás, Ingo Wegener:
The Oberwolfach Meeting On Combinatorics, Probability And Computing. Comb. Probab. Comput. 12(3): 223 (2003) - [j145]Béla Bollobás, Graham R. Brightwell, Yoshiharu Kohayakawa, Imre Leader, Alex D. Scott:
Special Issue on Ramsey Theory. Comb. Probab. Comput. 12(5-6): 467-468 (2003) - [j144]Béla Bollobás, Andrew Thomason:
Frank Ramsey. Comb. Probab. Comput. 12(5-6): 469-475 (2003) - [j143]Béla Bollobás, Amites Sarkar:
Paths of length four. Discret. Math. 265(1-3): 357-363 (2003) - [j142]Béla Bollobás, Oliver Riordan:
Robustness and Vulnerability of Scale-Free Random Graphs. Internet Math. 1(1): 1-35 (2003) - [j141]Béla Bollobás, Oliver Riordan:
Coupling Scale-Free and Classical Random Graphs. Internet Math. 1(2): 215-225 (2003) - [j140]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 B 87(2): 366-373 (2003) - [j139]Noga Alon, Béla Bollobás, Michael Krivelevich, Benny Sudakov:
Maximum cuts and judicious partitions in graphs without short cycles. J. Comb. Theory B 88(2): 329-346 (2003) - [j138]Béla Bollobás, Oliver Riordan:
Disjointly representing set systems. J. Comb. Theory A 102(1): 1-9 (2003) - [j137]Béla Bollobás, Graham R. Brightwell:
The number of k-SAT functions. Random Struct. Algorithms 22(3): 227-247 (2003) - [j136]Béla Bollobás, Imre Leader:
Union of shadows. Theor. Comput. Sci. 307(3): 493-502 (2003) - [c10]Noam Berger, Béla Bollobás, Christian Borgs, Jennifer T. Chayes, Oliver Riordan:
Degree Distribution of the FKP Network Model. ICALP 2003: 725-738 - [c9]Béla Bollobás, Christian Borgs, Jennifer T. Chayes, Oliver Riordan:
Directed scale-free graphs. SODA 2003: 132-139 - [c8]Béla Bollobás, Don Coppersmith, Michael Elkin:
Sparse distance preservers and additive spanners. SODA 2003: 414-423 - [p1]Béla Bollobás, Vladimir Nikiforov, Nicholas C. Wormald, Ralph J. Faudree, Alan M. Frieze:
Analytic Graph Theory. Handbook of Graph Theory 2003: 787-871 - 2002
- [b2]Béla Bollobás:
Modern Graph Theory. Graduate Texts in Mathematics 184, Springer 2002, ISBN 978-0-387-98488-9, pp. I-XIII, 1-394 - [j135]József Balogh, Béla Bollobás, David Weinreich:
Measures on monotone properties of graphs. Discret. Appl. Math. 116(1-2): 17-36 (2002) - [j134]Béla Bollobás, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
Random induced graphs. Discret. Math. 248(1-3): 249-254 (2002) - [j133]Paul N. Balister, Béla Bollobás, Richard H. Schelp:
Vertex distinguishing colorings of graphs with Delta(G)=2. Discret. Math. 252(1-3): 17-29 (2002) - [j132]Noga Alon, József Balogh, Béla Bollobás, Tamás Szabó:
Game domination number. Discret. Math. 256(1-2): 23-33 (2002) - [j131]Paul Balister, Béla Bollobás, Jonathan Cutler, Luke Pebody:
The Interlace Polynomial of Graphs at - 1. Eur. J. Comb. 23(7): 761-767 (2002) - [j130]Béla Bollobás:
Evaluations of the Circuit Partition Polynomial. J. Comb. Theory B 85(2): 261-268 (2002) - [j129]Béla Bollobás, Endre Szemerédi:
Girth of sparse graphs. J. Graph Theory 39(3): 194-200 (2002) - [j128]Béla Bollobás, Alex D. Scott:
Problems and results on judicious partitions. Random Struct. Algorithms 21(3-4): 414-430 (2002) - [c7]Sanjeev Arora, Béla Bollobás, László Lovász:
Proving Integrality Gaps without Knowing the Linear Program. FOCS 2002: 313-322 - 2001
- [j127]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) - [j126]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) - [j125]Béla Bollobás, Jair Donadelli, Yoshiharu Kohayakawa, Richard H. Schelp:
Ramsey minimal graphs. J. Braz. Comput. Soc. 7(3): 27-37 (2001) - [j124]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) - [j123]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) - [j122]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) - [c6]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 - 2000
- [j121]Béla Bollobás, Chula J. Jayawardene, Jiansheng Yang, Yi Ru Huang, Cecil C. Rousseau, Zhang Ke Min:
On a conjecture involving cycle-complete graph Ramsey numbers. Australas. J Comb. 22: 63-72 (2000) - [j120]Béla Bollobás, Andrew Thomason:
The Structure of Hereditary Properties and Colourings of Random Graphs. Comb. 20(2): 173-202 (2000) - [j119]Béla Bollobás, Oliver Riordan:
Constrained Graph Processes. Electron. J. Comb. 7 (2000) - [j118]Richard Arratia, Béla Bollobás, Don Coppersmith, Gregory B. Sorkin:
Euler circuits and DNA sequencing by hybridization. Discret. Appl. Math. 104(1-3): 63-96 (2000) - [j117]Béla Bollobás, Douglas B. West:
A note on generalized chromatic number and generalized girth. Discret. Math. 213(1-3): 29-34 (2000) - [j116]Béla Bollobás, Oliver Riordan:
Polychromatic polynomials. Discret. Math. 219(1-3): 1-7 (2000) - [j115]Béla Bollobás, Alex D. Scott:
Judicious Partitions of 3-uniform Hypergraphs. Eur. J. Comb. 21(3): 289-300 (2000) - [j114]Béla Bollobás, Alexandr V. Kostochka, Richard H. Schelp:
Local and Mean Ramsey Numbers for Trees. J. Comb. Theory B 79(1): 100-103 (2000) - [j113]József Balogh, Béla Bollobás, David Weinreich:
The Speed of Hereditary Properties of Graphs. J. Comb. Theory B 79(2): 131-156 (2000) - [j112]Béla Bollobás, Luke Pebody, Oliver Riordan:
Contraction-Deletion Invariants for Graphs. J. Comb. Theory B 80(2): 320-345 (2000) - [j111]Béla Bollobás, Colin Cooper, Trevor I. Fenner, Alan M. Frieze:
Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at least k. J. Graph Theory 34(1): 42-59 (2000) - [c5]Richard Arratia, Béla Bollobás, Gregory B. Sorkin:
The interlace polynomial: a new graph polynomial. SODA 2000: 237-245
1990 – 1999
- 1999
- [j110]Béla Bollobás, Alex D. Scott:
Exact Bounds for Judicious Partitions of Graphs. Comb. 19(4): 473-486 (1999) - [j109]Béla Bollobás, Oliver Riordan, Zdenek Ryjácek, Akira Saito, Richard H. Schelp:
Closure and Hamiltonian-connectivity of claw-free graphs. Discret. Math. 195(1-3): 67-80 (1999) - [j108]Béla Bollobás, Paul Erdös, Amites Sarkar:
Extremal graphs for weights. Discret. Math. 200(1-3): 5-19 (1999) - [j107]Béla Bollobás, Graham R. Brightwell, Alexander F. Sidorenko:
Geometrical Techniques for Estimating Numbers of Linear Extensions. Eur. J. Comb. 20(5): 329-335 (1999) - [j106]Béla Bollobás:
Turán's Theorem and Maximal Degrees. J. Comb. Theory B 75(1): 160-164 (1999) - [j105]Béla Bollobás, Andrew Thomason:
Weakly Pancyclic Graphs. J. Comb. Theory B 77(1): 121-137 (1999) - [j104]Paul Balister, Béla Bollobás, Alan Stacey:
Counting Boundary Paths for Oriented Percolation Clusters. Random Struct. Algorithms 14(1): 1-28 (1999) - 1998
- [j103]Béla Bollobás, Paul Erdös:
Graphs of Extremal Weights. Ars Comb. 50 (1998) - [j102]Béla Bollobás, Oliver Riordan:
On some conjectures of Graffiti. Discret. Math. 179(1-3): 223-230 (1998) - [j101]Béla Bollobás, Tamás Szabó:
The oriented cycle game. Discret. Math. 186(1-3): 55-67 (1998) - [j100]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) - [j99]Béla Bollobás, Oliver Riordan:
Colorings generated by monotone properties. Random Struct. Algorithms 12(1): 1-25 (1998) - [j98]Béla Bollobás:
Paul Erdös and probability theory. Random Struct. Algorithms 13(3-4): 521-533 (1998) - 1997
- [j97]Béla Bollobás, Graham R. Brightwell:
Random Walks and Electrical Resistances in Products of Graphs. Discret. Appl. Math. 73(1): 69-79 (1997) - [j96]Béla Bollobás, Imre Leader:
Matchings and Paths in the Cube. Discret. Appl. Math. 75(1): 1-8 (1997) - [j95]Béla Bollobás, Alex D. Scott:
Independent sets and repeated degrees. Discret. Math. 170(1-3): 41-49 (1997) - [j94]Béla Bollobás, Norbert Hegyvári, Guoping Jin:
On a problem of Erdös and Graham. Discret. Math. 175(1-3): 253-257 (1997) - [j93]Béla Bollobás, Alex D. Scott:
Judicious Partitions of Hypergraphs. J. Comb. Theory A 78(1): 15-31 (1997) - [j92]Béla Bollobás, Andrew Thomason:
On the girth of hamiltonian weakly pancyclic graphs. J. Graph Theory 26(3): 165-173 (1997) - [j91]Béla Bollobás, Graham R. Brightwell:
The Structure of Random Graph Orders. SIAM J. Discret. Math. 10(2): 318-335 (1997) - [c4]Béla Bollobás, Gautam Das, Dimitrios Gunopulos, Heikki Mannila:
Time-Series Similarity Problems and Well-Separated Geometric Sets. SCG 1997: 454-456 - 1996
- [j90]Béla Bollobás, Andrew Thomason:
Highly Linked Graphs. Comb. 16(3): 313-320 (1996) - [j89]Béla Bollobás:
Turán-Ramsey problems. Discret. Math. 156(1-3): 257-262 (1996) - [j88]Béla Bollobás:
Degree multiplicities and independent sets in K4-free graphs. Discret. Math. 158(1-3): 27-35 (1996) - [j87]Béla Bollobás, Imre Leader:
Sums in the grid. Discret. Math. 162(1-3): 31-48 (1996) - [j86]Béla Bollobás, Trevor I. Fenner, Alan M. Frieze:
On the Best Case of Heapsort. J. Algorithms 20(2): 205-217 (1996) - [j85]Béla Bollobás, Alex D. Scott:
A Proof of a Conjecture of Bondy Concerning Paths in Weighted Digraphs. J. Comb. Theory B 66(2): 283-292 (1996) - 1995
- [j84]Béla Bollobás, Yoshimi Egawa, Andrew J. Harris, Guoping Jin:
The maximal number of inducedr-partite subgraphs. Graphs Comb. 11(1): 1-19 (1995) - [j83]Béla Bollobás, A. J. Radcliffe:
Defect Sauer Results. J. Comb. Theory A 72(2): 189-208 (1995) - [j82]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) - [j81]Béla Bollobás, Andrew Thomason:
Generalized Chromatic Numbers of Random Graphs. Random Struct. Algorithms 6(2/3): 353-356 (1995) - 1994
- [j80]Béla Bollobás, Yoshiharu Kohayakawa:
An Extension of the Erdös-Stone Theorem. Comb. 14(3): 279-286 (1994) - [j79]Béla Bollobás, Yoshiharu Kohayakawa:
Percolation in High Dimensions. Eur. J. Comb. 15(2): 113-125 (1994) - [j78]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) - [j77]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
- [j76]Béla Bollobás, Paul Erdös, Joel Spencer, Douglas B. West:
Clique coverings of the edges of a random graph. Comb. 13(1): 1-5 (1993) - [j75]Béla Bollobás, Graham R. Brightwell:
Cycles through specified vertices. Comb. 13(2): 147-155 (1993) - [j74]Béla Bollobás, Imre Leader:
Maximal sets of given diameter in the grid and the torus. Discret. Math. 122(1-3): 15-35 (1993) - [j73]Béla Bollobás, István Simon:
Probabilistic Analysis of Disjoint Set Union Algorithms. SIAM J. Comput. 22(5): 1053-1074 (1993) - 1992
- [j72]Béla Bollobás, Amram Meir:
A travelling salesman problem in the k-dimensional unit cube. Oper. Res. Lett. 11(1): 19-21 (1992) - [j71]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
- [j70]Béla Bollobás, Imre Leader:
Edge-isoperimetric inequalities in the grid. Comb. 11(4): 299-314 (1991) - [j69]Béla Bollobás, H. R. Hind:
Graphs without large triangle free subgraphs. Discret. Math. 87(2): 119-131 (1991) - [j68]Béla Bollobás, Imre Leader:
Compressions and isoperimetric inequalities. J. Comb. Theory A 56(1): 47-62 (1991) - [j67]Béla Bollobás, Imre Leader:
Isoperimetric inequalities and fractional set systems. J. Comb. Theory A 56(1): 63-74 (1991) - [j66]Béla Bollobás, Alan M. Frieze:
Spanning Maximal Planar Subgraphs of Random Graphs. Random Struct. Algorithms 2(2): 225-232 (1991) - [c3]Béla Bollobás, Bruce A. Reed, Andrew Thomason:
An extremal function for the achromatic number. Graph Structure Theory 1991: 161-165 - 1990
- [j65]Béla Bollobás, Ernest J. Cockayne, Christina M. Mynhardt:
On generalised minimal domination parameters for paths. Discret. Math. 86(1-3): 89-97 (1990) - [j64]Béla Bollobás, A. J. Radcliffe:
Isoperimetric Inequalities for Faces of the Cube and the Grid. Eur. J. Comb. 11(4): 323-333 (1990) - [j63]Béla Bollobás, Imre Leader:
Exact Face-isoperimetric Inequalities. Eur. J. Comb. 11(4): 335-340 (1990) - [j62]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) - [j61]Béla Bollobás, Roland Häggkvist:
Powers of Hamilton cycles in tournaments. J. Comb. Theory B 50(2): 309-318 (1990) - [j60]Béla Bollobás:
Almost every graph has reconstruction number three. J. Graph Theory 14(1): 1-4 (1990) - [j59]Béla Bollobás:
Complete Matchings in Random Subgraphs on the Cube. Random Struct. Algorithms 1(1): 95-104 (1990) - [j58]Béla Bollobás, Graham R. Brightwell:
Parallel Selection with High Probability. SIAM J. Discret. Math. 3(1): 21-31 (1990) - [j57]Béla Bollobás, Imre Leader:
An Isoperimetric Inequality on the Discrete Torus. SIAM J. Discret. Math. 3(1): 32-37 (1990)
1980 – 1989
- 1989
- [j56]Béla Bollobás, H. R. Hind:
A new upper bound for the list chromatic number. Discret. Math. 74(1-2): 65-75 (1989) - [j55]Béla Bollobás:
Paul Erdös at seventy-five. Discret. Math. 75(1-3): 3-5 (1989) - [j54]Noga Alon, Béla Bollobás:
Graphs with a small number of distinct induced subgraphs. Discret. Math. 75(1-3): 23-30 (1989) - [j53]Béla Bollobás, Graham R. Brightwell:
Long cycles in graphs with no subgraphs of minimal degree 3. Discret. Math. 75(1-3): 47-53 (1989) - [j52]Béla Bollobás, Steen Rasmussen:
First cycles in random directed graph processes. Discret. Math. 75(1-3): 55-68 (1989) - 1988
- [j51]Béla Bollobás:
The chromatic number of random graphs. Comb. 8(1): 49-55 (1988) - [j50]Béla Bollobás:
Sorting in rounds. Discret. Math. 72(1-3): 21-28 (1988) - [j49]Béla Bollobás:
The Isoperimetric Number of Random Regular Graphs. Eur. J. Comb. 9(3): 241-244 (1988) - [j48]Béla Bollobás:
The number of unrelated partitions. J. Comb. Theory A 49(2): 389-391 (1988) - [j47]Béla Bollobás, Graham R. Brightwell:
Transitive Orientations of Graphs. SIAM J. Comput. 17(6): 1119-1133 (1988) - [j46]Béla Bollobás, Fan R. K. Chung:
The Diameter of a Cycle Plus a Random Matching. SIAM J. Discret. Math. 1(3): 328-333 (1988) - 1987
- [j45]Béla Bollobás, Andrew Thomason:
Threshold functions. Comb. 7(1): 35-38 (1987) - [j44]Béla Bollobás, Trevor I. Fenner, Alan M. Frieze:
An algorithm for finding Hamilton cycles in a random graph. Comb. 7(4): 327-341 (1987) - 1986
- [b1]Béla Bollobás:
Extremal graph theory with emphasis on probabilistic methods. CBMS-NSF regional conference series in applied mathematics 62, American Mathematical Society 1986, ISBN 978-0-8218-0712-5, pp. I-VII, 1-64 - [j43]Béla Bollobás, Chie Nara, Shun-ichi Tachibana:
The maximal number of induced complete bipartite graphs. Discret. Math. 62(3): 271-275 (1986) - [j42]Béla Bollobás, Brendan D. McKay:
The number of matchings in random regular graphs and bipartite graphs. J. Comb. Theory B 41(1): 80-91 (1986) - 1985
- [j41]Béla Bollobás, Andrew J. Harris:
List-colourings of graphs. Graphs Comb. 1(1): 115-127 (1985) - [j40]Béla Bollobás, István Simon:
Repeated Random Insertion into a Priority Queue. J. Algorithms 6(4): 466-477 (1985) - [j39]Béla Bollobás, Akira Saito, Nicholas C. Wormald:
Regular factors of regular graphs. J. Graph Theory 9(1): 97-103 (1985) - [c2]Béla Bollobás, István Simon:
On the Expected Behaviour of Disjoint Set Union Algorithms. STOC 1985: 224-231 - [c1]Béla Bollobás, Trevor I. Fenner, Alan M. Frieze:
An Algorithm for Finding Hamilton Cycles in a Random Graph. STOC 1985: 430-439 - 1984
- [j38]Béla Bollobás, Victor Klee:
Diameters of random bipartite graphs. Comb. 4(1): 7-19 (1984) - [j37]Béla Bollobás, Ernest J. Cockayne:
The irredundance number and maximum degree of a graph. Discret. Math. 49(2): 197-199 (1984) - [j36]Béla Bollobás, Ernest J. Cockayne, Fang Zu Yao:
Rotation numbers for unions of circuits. J. Graph Theory 8(1): 69-81 (1984) - 1983
- [j35]Béla Bollobás, Andrew Thomason:
Parallel sorting. Discret. Appl. Math. 6(1): 1-11 (1983) - [j34]Béla Bollobás:
Some remarks on packing trees. Discret. Math. 46(2): 203-204 (1983) - [j33]Béla Bollobás:
Almost all Regular Graphs are Hamiltonian. Eur. J. Comb. 4(2): 97-106 (1983) - [j32]Béla Bollobás, Richard K. Guy:
Equitable and proportional coloring of trees. J. Comb. Theory B 34(2): 177-186 (1983) - [j31]Béla Bollobás, Pierre Duchet:
On Helly families of maximal size. J. Comb. Theory B 35(3): 290-296 (1983) - [j30]Béla Bollobás, Ove Frank, Michal Karonski:
On 4-cycles in random bipartite tournaments. J. Graph Theory 7(2): 183-194 (1983) - 1982
- [j29]Béla Bollobás, Wenceslas Fernandez de la Vega:
The diameter of random regular graphs. Comb. 2(2): 125-134 (1982) - [j28]Béla Bollobás:
Long paths in sparse random graphs. Comb. 2(3): 223-228 (1982) - [j27]Béla Bollobás:
Vertices of given degree in a random graph. J. Graph Theory 6(2): 147-155 (1982) - [j26]Béla Bollobás, Ernest J. Cockayne:
More rotation numbers for complete bipartite graphs. J. Graph Theory 6(4): 403-411 (1982) - 1981
- [j25]Béla Bollobás:
Degree sequences of random graphs. Discret. Math. 33(1): 1-19 (1981) - [j24]Béla Bollobás, Andrew Thomason:
Graphs which Contain all Small Graphs. Eur. J. Comb. 2(1): 13-15 (1981) - [j23]Béla Bollobás, Paul A. Catlin:
Topological cliques of random graphs. J. Comb. Theory B 30(2): 224-227 (1981) - [j22]Béla Bollobás, Donald L. Goldsmith, Douglas R. Woodall:
Indestructive deletions of edges from graphs. J. Comb. Theory B 30(3): 263-275 (1981) - [j21]Béla Bollobás, Carsten Thomassen:
The size of connected hypergraphs with prescribed covering number. J. Comb. Theory B 31(2): 150-155 (1981) - [j20]Béla Bollobás, Andrew Thomason:
Dense neighbourhoods and Turán's theorem. J. Comb. Theory B 31(3): 111-114 (1981) - 1980
- [j19]Béla Bollobás:
The distribution of the maximum degree of a random graph. Discret. Math. 32(2): 201-203 (1980) - [j18]Béla Bollobás, Paul A. Catlin, Paul Erdös:
Hadwiger's Conjecture is True for Almost Every Graph. Eur. J. Comb. 1(3): 195-199 (1980) - [j17]Béla Bollobás:
A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs. Eur. J. Comb. 1(4): 311-316 (1980)
1970 – 1979
- 1979
- [j16]Béla Bollobás, Andrew Thomason:
Set colourings of graphs. Discret. Math. 25(1): 21-26 (1979) - [j15]Béla Bollobás:
On graphs with equal edge connectivity and minimum degree. Discret. Math. 28(3): 321-323 (1979) - [j14]Béla Bollobás, Pierre Duchet:
Helly Families of Maximal Size. J. Comb. Theory A 26(2): 197-200 (1979) - [j13]Béla Bollobás, Ernest J. Cockayne:
Graph-theoretic parameters concerning domination, independence, and irredundance. J. Graph Theory 3(3): 241-249 (1979) - 1978
- [j12]Béla Bollobás:
Chromatic number, girth and maximal degree. Discret. Math. 24(3): 311-314 (1978) - [j11]Béla Bollobás:
Uniquely colorable graphs. J. Comb. Theory B 25(1): 54-61 (1978) - [j10]Béla Bollobás, Stephen E. Eldridge:
Packings of graphs and applications to computational complexity. J. Comb. Theory B 25(2): 105-124 (1978) - [j9]Béla Bollobás:
The number of 1-factors in 2k-connected graphs. J. Comb. Theory B 25(3): 363-366 (1978) - 1977
- [j8]Béla Bollobás:
Semi-topological subgraphs. Discret. Math. 20: 83-85 (1977) - [j7]Béla Bollobás:
Extremal problems in graph theory. J. Graph Theory 1(2): 117-123 (1977) - 1976
- [j6]Béla Bollobás:
Complete subgraphs are elusive. J. Comb. Theory B 21(1): 1-7 (1976) - [j5]Béla Bollobás, Paul Erdös:
On a Ramsey-Turán type problem. J. Comb. Theory B 21(2): 166-168 (1976) - [j4]Béla Bollobás, Stephen E. Eldridge:
On graphs with diameter 2. J. Comb. Theory B 21(3): 201-205 (1976) - 1975
- [j3]Béla Bollobás, Paul Erdös, Endre Szemerédi:
On complete subgraphs of r-chromatic graphs. Discret. Math. 13(2): 97-107 (1975) - 1974
- [j2]Béla Bollobás:
Three-graphs without two triples whose symmetric difference is contained in a third. Discret. Math. 8(1): 21-24 (1974) - 1973
- [j1]Béla Bollobás:
Sperner Systems Consisting of Pairs of Complementary Subsets. J. Comb. Theory A 15(3): 363-366 (1973)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:11 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:
