Béla Bollobás

304 papers A* 10A 1B 2C 2Journal 276Unranked 3

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	Subcritical monotone cellular automata. Random Struct. Algorithms Paul Balister, Béla Bollobás, Robert Morris, Paul Smith
2021	J	`jnl`	Counting independent sets in regular hypergraphs. J. Comb. Theory A József Balogh, Béla Bollobás, Bhargav P. Narayanan
2020	J	`jnl`	Nucleation and growth in two dimensions. Random Struct. Algorithms Béla Bollobás, Simon Griffiths, Robert Morris, Leonardo T. Rolla, Paul Smith
2019	J	`jnl`	Dense subgraphs in random graphs. Discret. Appl. Math. Paul Balister, Béla Bollobás, Julian Sahasrabudhe, Alexander Veremyev
2018	J	`jnl`	Counting dense connected hypergraphs via the probabilistic method. Random Struct. Algorithms Béla Bollobás, Oliver Riordan
2018	J	`jnl`	Eigenvalues of subgraphs of the cube. Eur. J. Comb. Béla Bollobás, Jonathan Lee, Shoham Letzter
2018	J	`jnl`	Introduction. Comb. Probab. Comput. Paul Balister, Béla Bollobás, Imre Leader, Robert Morris
2018	J	`jnl`	Line percolation. Random Struct. Algorithms Paul Balister, Béla Bollobás, Jonathan Lee, Bhargav P. Narayanan
2018	J	`jnl`	Longest common extension. Eur. J. Comb. Béla Bollobás, Shoham Letzter
2018	C	`conf`	Making Squares - Sieves, Smooth Numbers, Cores and Random Xorsat (Keynote Speakers). AofA Béla Bollobás
2017	J	`jnl`	Catching a fast robber on the grid. J. Comb. Theory A Paul Balister, Amy Shaw, Béla Bollobás, Bhargav P. Narayanan
2017	J	`jnl`	Exploring hypergraphs with martingales. Random Struct. Algorithms Béla Bollobás, Oliver Riordan
2017	J	`jnl`	Jigsaw percolation on random hypergraphs. J. Appl. Probab. Béla Bollobás, Oliver Cooley, Mihyun Kang, Christoph Koch
2017	J	`jnl`	On the Maximum Running Time in Graph Bootstrap Percolation. Electron. J. Comb. Béla Bollobás, Michal Przykucki, Oliver Riordan, Julian Sahasrabudhe
2017	J	`jnl`	Packing random graphs and hypergraphs. Random Struct. Algorithms Béla Bollobás, Svante Janson, Alex Scott
2017	J	`jnl`	Sentry selection in sensor networks: theory and algorithms. Int. J. Sens. Networks Paul Balister, Béla Bollobás, Martin Haenggi, Amites Sarkar, Mark Walters
2017	J	`jnl`	The Threshold for Jigsaw Percolation on Random Graphs. Electron. J. Comb. Béla Bollobás, Oliver Riordan, Erik Slivken, Paul Smith
2016	J	`jnl`	Barrier Coverage. Random Struct. Algorithms Paul Balister, Béla Bollobás, Amites Sarkar
2016	J	`jnl`	Catching a fast robber on the grid. CoRR Paul Balister, Scott Binski, Béla Bollobás, Bhargav P. Narayanan
2016	J	`jnl`	Counting Connected Hypergraphs via the Probabilistic Method. Comb. Probab. Comput. Béla Bollobás, Oliver Riordan
2016	J	`jnl`	On the stability of the Erdős-Ko-Rado theorem. J. Comb. Theory A Béla Bollobás, Bhargav P. Narayanan, Andrei M. Raigorodskii
2016	J	`jnl`	Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs. Eur. J. Comb. Paul Balister, Béla Bollobás, Karen Gunderson
2016	J	`jnl`	Random Hypergraph Irregularity. SIAM J. Discret. Math. Paul N. Balister, Béla Bollobás, Jenö Lehel, Michal Morayne
2015	J	`jnl`	An old approach to the giant component problem. J. Comb. Theory B Béla Bollobás, Oliver Riordan
2015	J	`jnl`	Disjoint induced subgraphs of the same order and size. Eur. J. Comb. Béla Bollobás, Teeradej Kittipassorn, Bhargav P. Narayanan, Alexander D. Scott
2015	J	`jnl`	Intersections of hypergraphs. J. Comb. Theory B Béla Bollobás, Alex D. Scott
2015	J	`jnl`	Intersections of random hypergraphs and tournaments. Eur. J. Comb. Béla Bollobás, Alex D. Scott
2015	J	`jnl`	Monotone Cellular Automata in a Random Environment. Comb. Probab. Comput. Béla Bollobás, Paul Smith, Andrew J. Uzzell
2015	J	`jnl`	Partial Shadows of Set Systems. Comb. Probab. Comput. Béla Bollobás, Tom Eccles
2015	J	`jnl`	The time of bootstrap percolation with dense initial sets for all thresholds. Random Struct. Algorithms Béla Bollobás, Paul Smith, Andrew J. Uzzell
2014	—	`ch.`	A coding problem for pairs of subsets. Geometry, Structure and Randomness in Combinatorics Béla Bollobás, Zoltán Füredi, Ida Kantor, Gyula O. H. Katona, Imre Leader
2014	J	`jnl`	Interference percolation. Random Struct. Algorithms Paul Balister, Béla Bollobás
2013	J	`jnl`	A small probabilistic universal set of starting points for finding roots of complex polynomials by Newton's method. Math. Comput. Béla Bollobás, Malte Lackmann, Dierk Schleicher
2013	J	`jnl`	Cops and robbers in a random graph. J. Comb. Theory B Béla Bollobás, Gábor Kun, Imre Leader
2013	J	`jnl`	Cover-Decomposition and Polychromatic Numbers. SIAM J. Discret. Math. Béla Bollobás, David Pritchard, Thomas Rothvoß, Alex D. Scott
2013	—	`ch.`	Hereditary and Monotone Properties of Graphs. The Mathematics of Paul Erdős II Béla Bollobás, Andrew Thomason
2013	J	`jnl`	Metric Dimension for Random Graphs. Electron. J. Comb. Béla Bollobás, Dieter Mitsche, Pawel Pralat
2013	—	`ch.`	Paul Erdős: Life and Work. The Mathematics of Paul Erdős I Béla Bollobás
2013	J	`jnl`	Repeated Degrees in Random Uniform Hypergraphs. SIAM J. Discret. Math. Paul Balister, Béla Bollobás, Jenö Lehel, Michal Morayne
2013	—	`ch.`	The Dimension of Random Graph Orders. The Mathematics of Paul Erdős II Béla Bollobás, Graham R. Brightwell
2013	J	`jnl`	Union-closed families of sets. J. Comb. Theory A Igor Balla, Béla Bollobás, Tom Eccles
2012	J	`jnl`	A Simple Branching Process Approach to the Phase Transition in G Electron. J. Comb. Béla Bollobás, Oliver Riordan
2012	J	`jnl`	Asymptotic normality of the size of the giant component in a random hypergraph. Random Struct. Algorithms Béla Bollobás, Oliver Riordan
2012	J	`jnl`	Asymptotic normality of the size of the giant component via a random walk. J. Comb. Theory B Béla Bollobás, Oliver Riordan
2012	J	`jnl`	Critical Probabilities of 1-Independent Percolation Models. Comb. Probab. Comput. Paul Balister, Béla Bollobás
2012	J	`jnl`	Degree Powers in Graphs: The Erdős-Stone Theorem. Comb. Probab. Comput. Béla Bollobás, Vladimir Nikiforov
2012	J	`jnl`	Graph bootstrap percolation. Random Struct. Algorithms József Balogh, Béla Bollobás, Robert Morris
2012	J	`jnl`	Linear algebra and bootstrap percolation. J. Comb. Theory A József Balogh, Béla Bollobás, Robert Morris, Oliver Riordan
2012	J	`jnl`	Monotone Graph Limits and Quasimonotone Graphs. Internet Math. Béla Bollobás, Svante Janson, Oliver Riordan
2012	J	`jnl`	Projections, entropy and sumsets. Comb. Paul Balister, Béla Bollobás
2012	J	`jnl`	Turán Densities of Some Hypergraphs Related to K SIAM J. Discret. Math. József Balogh, Tom Bohman, Béla Bollobás, Yi Zhao
2012	J	`jnl`	Walks and paths in trees. J. Graph Theory Béla Bollobás, Mykhaylo Tyomkyn
2011	A	`conf`	Cover-Decomposition and Polychromatic Numbers. ESA Béla Bollobás, David Pritchard, Thomas Rothvoß, Alex D. Scott
2011	J	`jnl`	Daisies and Other Turán Problems. Comb. Probab. Comput. Béla Bollobás, Imre Leader, Claudia Malvenuto
2011	J	`jnl`	Energy-Latency Tradeoff for In-Network Function Computation in Random Networks CoRR Paul N. Balister, Béla Bollobás, Animashree Anandkumar, Alan S. Willsky
2011	A*	`conf`	Energy-latency tradeoff for in-network function computation in random networks. INFOCOM Paul Balister, Béla Bollobás, Animashree Anandkumar, Alan S. Willsky
2011	J	`jnl`	Intersections of graphs. J. Graph Theory Béla Bollobás, Alex D. Scott
2011	J	`jnl`	Large joints in graphs. Eur. J. Comb. Béla Bollobás, Vladimir Nikiforov
2011	J	`jnl`	Multi-path Routing Metrics for Reliable Wireless Mesh Routing Topologies CoRR Phoebus Chen, Karl Henrik Johansson, Paul Balister, Béla Bollobás, Shankar Sastry
2011	J	`jnl`	On covering by translates of a set. Random Struct. Algorithms Béla Bollobás, Svante Janson, Oliver Riordan
2011	—	`book`	Random Graphs, Second Edition Béla Bollobás
2011	J	`jnl`	Shadows of ordered graphs. J. Comb. Theory A Béla Bollobás, Graham R. Brightwell, Robert Morris
2011	J	`jnl`	Sparse graphs: Metrics and random models. Random Struct. Algorithms Béla Bollobás, Oliver Riordan
2011	J	`jnl`	Sparse random graphs with clustering. Random Struct. Algorithms Béla Bollobás, Svante Janson, Oliver Riordan
2011	J	`jnl`	The fine structure of octahedron-free graphs. J. Comb. Theory B József Balogh, Béla Bollobás, Miklós Simonovits
2011	J	`jnl`	The structure of almost all graphs in a hereditary property. J. Comb. Theory B Noga Alon, József Balogh, Béla Bollobás, Robert Morris
2010	J	`jnl`	Bond percolation with attenuation in high dimensional Voronoi tilings. Random Struct. Algorithms Paul N. Balister, Béla Bollobás
2010	J	`jnl`	Bootstrap Percolation in High Dimensions. Comb. Probab. Comput. József Balogh, Béla Bollobás, Robert Morris
2010	J	`jnl`	Introduction. Comb. Probab. Comput. Noga Alon, Béla Bollobás
2010	J	`jnl`	Max k-cut and judicious k-partitions. Discret. Math. Béla Bollobás, Alex D. Scott
2010	J	`jnl`	Random majority percolation. Random Struct. Algorithms Paul Balister, Béla Bollobás, J. Robert Johnson, Mark Walters
2010	J	`jnl`	The number of graphs with large forbidden subgraphs. Eur. J. Comb. Béla Bollobás, Vladimir Nikiforov
2009	J	`jnl`	Clique percolation. Random Struct. Algorithms Béla Bollobás, Oliver Riordan
2009	J	`jnl`	Highly connected random geometric graphs. Discret. Appl. Math. Paul N. Balister, Béla Bollobás, Amites Sarkar, Mark Walters
2009	J	`jnl`	Introduction. Comb. Probab. Comput. Noga Alon, Béla Bollobás
2009	J	`jnl`	Line-of-Sight Percolation. Comb. Probab. Comput. Béla Bollobás, Svante Janson, Oliver Riordan
2009	J	`jnl`	Majority Bootstrap Percolation on the Hypercube. Comb. Probab. Comput. József Balogh, Béla Bollobás, Robert Morris
2009	J	`jnl`	The distribution of the root degree of a random permutation. Comb. Béla Bollobás, Boris G. Pittel
2009	J	`jnl`	The typical structure of graphs without given excluded subgraphs. Random Struct. Algorithms József Balogh, Béla Bollobás, Miklós Simonovits
2009	J	`jnl`	The unlabelled speed of a hereditary graph property. J. Comb. Theory B József Balogh, Béla Bollobás, Michael E. Saks, Vera T. Sós
2008	J	`jnl`	Connectivity of a Gaussian network. Int. J. Ad Hoc Ubiquitous Comput. Paul N. Balister, Béla Bollobás, Amites Sarkar, Mark Walters
2008	J	`jnl`	Connectivity of addable graph classes. J. Comb. Theory B Paul Balister, Béla Bollobás, Stefanie Gerke
2008	J	`jnl`	Eliminating Cycles in the Discrete Torus. Algorithmica Béla Bollobás, Guy Kindler, Imre Leader, Ryan O'Donnell
2008	J	`jnl`	Graphs and Hermitian matrices: Exact interlacing. Discret. Math. Béla Bollobás, Vladimir Nikiforov
2008	J	`jnl`	Highly connected monochromatic subgraphs. Discret. Math. Béla Bollobás, András Gyárfás
2008	J	`jnl`	Joints in graphs. Discret. Math. Béla Bollobás, Vladimir Nikiforov
2008	J	`jnl`	Packing d-degenerate graphs. J. Comb. Theory B Béla Bollobás, Alexandr V. Kostochka, Kittikorn Nakprasit
2008	J	`jnl`	Pentagons vs. triangles. Discret. Math. Béla Bollobás, Ervin Györi
2008	J	`jnl`	Percolation on dual lattices with Random Struct. Algorithms Béla Bollobás, Oliver Riordan
2008	J	`jnl`	Sequences with Changing Dependencies. SIAM J. Discret. Math. Paul Balister, Béla Bollobás, Stefanie Gerke
2007	J	`jnl`	A note on the Harris-Kesten Theorem. Eur. J. Comb. Béla Bollobás, Oliver Riordan
2007	J	`jnl`	Cliques and the spectral radius. J. Comb. Theory B Béla Bollobás, Vladimir Nikiforov
2007	J	`jnl`	Degree distribution of the FKP network model. Theor. Comput. Sci. Noam Berger, Béla Bollobás, Christian Borgs, Jennifer T. Chayes, Oliver Riordan
2007	J	`jnl`	Hereditary Properties of Tournaments. Electron. J. Comb. József Balogh, Béla Bollobás, Robert Morris
2007	J	`jnl`	Hereditary properties of combinatorial structures: Posets and oriented graphs. J. Graph Theory József Balogh, Béla Bollobás, Robert Morris
2007	J	`jnl`	Maximum directed cuts in acyclic digraphs. J. Graph Theory Noga Alon, Béla Bollobás, András Gyárfás, Jenö Lehel, Alex D. Scott
2007	J	`jnl`	On separating systems. Eur. J. Comb. Béla Bollobás, Alex D. Scott
2007	A*	`conf`	Reliable density estimates for coverage and connectivity in thin strips of finite length. MobiCom Paul Balister, Béla Bollobás, Amites Sarkar, Santosh Kumar
2007	J	`jnl`	Separating systems and oriented graphs of diameter two. J. Comb. Theory B Béla Bollobás, Alex D. Scott
2007	J	`jnl`	Spread-out percolation in R Random Struct. Algorithms Béla Bollobás, Svante Janson, Oliver Riordan
2007	J	`jnl`	The generalized Randic index of trees. J. Graph Theory Paul N. Balister, Béla Bollobás, Stefanie Gerke
2007	J	`jnl`	The phase transition in inhomogeneous random graphs. Random Struct. Algorithms Béla Bollobás, Svante Janson, Oliver Riordan
2006	B	`conf`	Eliminating Cycles in the Discrete Torus. LATIN Béla Bollobás, Guy Kindler, Imre Leader, Ryan O'Donnell
2006	J	`jnl`	Hereditary properties of partitions, ordered graphs and ordered hypergraphs. Eur. J. Comb. József Balogh, Béla Bollobás, Robert Morris
2006	J	`jnl`	How many graphs are unions of J. Graph Theory Béla Bollobás, Graham R. Brightwell
2006	J	`jnl`	Large deviations for mean field models of probabilistic cellular automata. Random Struct. Algorithms Paul N. Balister, Béla Bollobás, Robert Kozma
2006	J	`jnl`	Pair dominating graphs. Eur. J. Comb. Paul N. Balister, Béla Bollobás
2006	—	`book`	Percolation. Béla Bollobás, Oliver Riordan
2006	J	`jnl`	Proving Integrality Gaps without Knowing the Linear Program. Theory Comput. Sanjeev Arora, Béla Bollobás, László Lovász, Iannis Tourlakis
2006	J	`jnl`	Ramsey-type theorems for metric spaces with applications to online problems. J. Comput. Syst. Sci. Yair Bartal, Béla Bollobás, Manor Mendel
2006	J	`jnl`	Regular subgraphs of random graphs. Random Struct. Algorithms Béla Bollobás, Jeong Han Kim, Jacques Verstraëte
2006	J	`jnl`	Set colourings of graphs. Discret. Math. Béla Bollobás, Andrew Thomason
2006	J	`jnl`	Sharp thresholds and percolation in the plane. Random Struct. Algorithms Béla Bollobás, Oliver Riordan
2006	J	`jnl`	The Angel and the Devil in three dimensions. J. Comb. Theory A Béla Bollobás, Imre Leader
2006	—	`book`	The Art of Mathematics - Coffee Time in Memphis. Béla Bollobás
2005	J	`jnl`	A jump to the bell number for hereditary graph properties. J. Comb. Theory B József Balogh, Béla Bollobás, David Weinreich
2005	J	`jnl`	Books in graphs. Eur. J. Comb. Béla Bollobás, Vladimir Nikiforov
2005	J	`jnl`	Continuum percolation with steps in the square or the disc. Random Struct. Algorithms Paul N. Balister, Béla Bollobás, Mark Walters
2005	J	`jnl`	Hereditary properties of words. RAIRO Theor. Informatics Appl. József Balogh, Béla Bollobás
2005	J	`jnl`	Integer sets with prescribed pairwise differences being distinct. Eur. J. Comb. Béla Bollobás, Oleg Pikhurko
2005	J	`jnl`	Percolation in Voronoi tilings. Random Struct. Algorithms Paul N. Balister, Béla Bollobás, Anthony Quas
2005	J	`jnl`	Phase transitions in the neuropercolation model of neural populations with mixed local and non-local interactions. Biol. Cybern. Robert Kozma, Marko Puljic, Paul Balister, Béla Bollobás, Walter J. Freeman
2005	J	`jnl`	Slow emergence of the giant component in the growing Random Struct. Algorithms Béla Bollobás, Oliver Riordan
2005	J	`jnl`	Sparse Distance Preservers and Additive Spanners. SIAM J. Discret. Math. Béla Bollobás, Don Coppersmith, Michael Elkin
2005	J	`jnl`	The Sum of Degrees in Cliques. Electron. J. Comb. Béla Bollobás, Vladimir Nikiforov
2005	J	`jnl`	The phase transition in the uniformly grown random graph has infinite order. Random Struct. Algorithms Béla Bollobás, Svante Janson, Oliver Riordan
2005	J	`jnl`	Unavoidable Traces Of Set Systems. Comb. József Balogh, Béla Bollobás
2004	J	`jnl`	A Two-Variable Interlace Polynomial. Comb. Richard Arratia, Béla Bollobás, Gregory B. Sorkin
2004	J	`jnl`	Degree Powers in Graphs with Forbidden Subgraphs. Electron. J. Comb. Béla Bollobás, Vladimir Nikiforov
2004	B	`conf`	Fast transmission in ad hoc networks. ISIT Paul Balister, Béla Bollobás, Martin Haenggi, Mark Walters
2004	J	`jnl`	Graphs and Hermitian matrices: eigenvalue interlacing. Discret. Math. Béla Bollobás, Vladimir Nikiforov
2004	J	`jnl`	Hermitian matrices and graphs: singular values and discrepancy. Discret. Math. Béla Bollobás, Vladimir Nikiforov
2004	J	`jnl`	How Sharp is the Concentration of the Chromatic Number? Comb. Probab. Comput. Béla Bollobás
2004	J	`jnl`	Isoperimetric Problems for r-sets. Comb. Probab. Comput. Béla Bollobás, Imre Leader
2004	J	`jnl`	Judicious partitions of bounded-degree graphs. J. Graph Theory Béla Bollobás, Alex D. Scott
2004	J	`jnl`	Max Cut for Random Graphs with a Planted Partition. Comb. Probab. Comput. Béla Bollobás, Alex D. Scott
2004	J	`jnl`	Multicoloured extremal problems. J. Comb. Theory A Béla Bollobás, Peter Keevash, Benny Sudakov
2004	—	`conf`	Neuropercolation: A Random Cellular Automata Approach to Spatio-temporal Neurodynamics. ACRI Robert Kozma, Marko Puljic, Paul Balister, Béla Bollobás, Walter J. Freeman
2004	J	`jnl`	On the Value of a Random Minimum Weight Steiner Tree. Comb. Béla Bollobás, David Gamarnik, Oliver Riordan, Benny Sudakov
2004	J	`jnl`	Ramsey-type theorems for metric spaces with applications to online problems CoRR Yair Bartal, Béla Bollobás, Manor Mendel
2004	J	`jnl`	The Diameter of a Scale-Free Random Graph. Comb. Béla Bollobás, Oliver Riordan
2004	C	`conf`	The Phase Transition and Connectedness in Uniformly Grown Random Graphs. WAW Béla Bollobás, Oliver Riordan
2004	J	`jnl`	The interlace polynomial of a graph. J. Comb. Theory B Richard Arratia, Béla Bollobás, Gregory B. Sorkin
2004	J	`jnl`	The number of graphs without forbidden subgraphs. J. Comb. Theory B József Balogh, Béla Bollobás, Miklós Simonovits
2003	—	`ch.`	Analytic Graph Theory. Handbook of Graph Theory Béla Bollobás, Vladimir Nikiforov, Nicholas C. Wormald, Ralph J. Faudree, Alan M. Frieze
2003	J	`jnl`	Coupling Scale-Free and Classical Random Graphs. Internet Math. Béla Bollobás, Oliver Riordan
2003	A*	`conf`	Degree Distribution of the FKP Network Model. ICALP Noam Berger, Béla Bollobás, Christian Borgs, Jennifer T. Chayes, Oliver Riordan
2003	A*	`conf`	Directed scale-free graphs. SODA Béla Bollobás, Christian Borgs, Jennifer T. Chayes, Oliver Riordan
2003	J	`jnl`	Disjointly representing set systems. J. Comb. Theory A Béla Bollobás, Oliver Riordan
2003	J	`jnl`	Frank Ramsey. Comb. Probab. Comput. Béla Bollobás, Andrew Thomason
2003	J	`jnl`	Graphs with large maximum degree containing no odd cycles of a given length. J. Comb. Theory B Paul Balister, Béla Bollobás, Oliver Riordan, Richard H. Schelp
2003	J	`jnl`	Maximum cuts and judicious partitions in graphs without short cycles. J. Comb. Theory B Noga Alon, Béla Bollobás, Michael Krivelevich, Benny Sudakov
2003	J	`jnl`	Paths of length four. Discret. Math. Béla Bollobás, Amites Sarkar
2003	J	`jnl`	Robustness and Vulnerability of Scale-Free Random Graphs. Internet Math. Béla Bollobás, Oliver Riordan
2003	J	`jnl`	Set Systems with few Disjoint Pairs. Comb. Béla Bollobás, Imre Leader
2003	A*	`conf`	Sparse distance preservers and additive spanners. SODA Béla Bollobás, Don Coppersmith, Michael Elkin
2003	J	`jnl`	Special Issue on Ramsey Theory. Comb. Probab. Comput. Béla Bollobás, Graham R. Brightwell, Yoshiharu Kohayakawa, Imre Leader, Alex D. Scott
2003	J	`jnl`	The Oberwolfach Meeting On Combinatorics, Probability And Computing. Comb. Probab. Comput. Béla Bollobás, Ingo Wegener
2003	J	`jnl`	The number of k-SAT functions. Random Struct. Algorithms Béla Bollobás, Graham R. Brightwell
2003	J	`jnl`	Union of shadows. Theor. Comput. Sci. Béla Bollobás, Imre Leader
2002	J	`jnl`	Evaluations of the Circuit Partition Polynomial. J. Comb. Theory B Béla Bollobás
2002	J	`jnl`	Game domination number. Discret. Math. Noga Alon, József Balogh, Béla Bollobás, Tamás Szabó
2002	J	`jnl`	Girth of sparse graphs. J. Graph Theory Béla Bollobás, Endre Szemerédi
2002	J	`jnl`	Measures on monotone properties of graphs. Discret. Appl. Math. József Balogh, Béla Bollobás, David Weinreich
2002	—	`book`	Modern Graph Theory. Béla Bollobás
2002	J	`jnl`	Problems and results on judicious partitions. Random Struct. Algorithms Béla Bollobás, Alex D. Scott
2002	A*	`conf`	Proving Integrality Gaps without Knowing the Linear Program. FOCS Sanjeev Arora, Béla Bollobás, László Lovász
2002	J	`jnl`	Random induced graphs. Discret. Math. Béla Bollobás, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
2002	J	`jnl`	The Interlace Polynomial of Graphs at - 1. Eur. J. Comb. Paul Balister, Béla Bollobás, Jonathan Cutler, Luke Pebody
2002	J	`jnl`	Vertex distinguishing colorings of graphs with Delta(G)=2. Discret. Math. Paul N. Balister, Béla Bollobás, Richard H. Schelp
2001	A*	`conf`	A Ramsy-type Theorem for Metric Spaces and its Applications for Metrical Task Systems and Related Problems. FOCS Yair Bartal, Béla Bollobás, Manor Mendel
2001	J	`jnl`	Alternating Knot Diagrams, Euler Circuits and the Interlace Polynomial. Eur. J. Comb. Paul N. Balister, Béla Bollobás, Oliver Riordan, Alex D. Scott
2001	J	`jnl`	Ramsey minimal graphs. J. Braz. Comput. Soc. Béla Bollobás, Jair Donadelli, Yoshiharu Kohayakawa, Richard H. Schelp
2001	J	`jnl`	The Penultimate Rate of Growth for Graph Properties. Eur. J. Comb. József Balogh, Béla Bollobás, David Weinreich
2001	J	`jnl`	The degree sequence of a scale-free random graph process. Random Struct. Algorithms Béla Bollobás, Oliver Riordan, Joel Spencer, Gábor E. Tusnády
2001	J	`jnl`	The scaling window of the 2-SAT transition. Random Struct. Algorithms Béla Bollobás, Christian Borgs, Jennifer T. Chayes, Jeong Han Kim, David Bruce Wilson
2001	J	`jnl`	Time-Series Similarity Problems and Well-Separated Geometric Sets. Nord. J. Comput. Béla Bollobás, Gautam Das, Dimitrios Gunopulos, Heikki Mannila
2000	J	`jnl`	A note on generalized chromatic number and generalized girth. Discret. Math. Béla Bollobás, Douglas B. West
2000	J	`jnl`	Constrained Graph Processes. Electron. J. Comb. Béla Bollobás, Oliver Riordan
2000	J	`jnl`	Contraction-Deletion Invariants for Graphs. J. Comb. Theory B Béla Bollobás, Luke Pebody, Oliver Riordan
2000	J	`jnl`	Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at least J. Graph Theory Béla Bollobás, Colin Cooper, Trevor I. Fenner, Alan M. Frieze
2000	J	`jnl`	Euler circuits and DNA sequencing by hybridization. Discret. Appl. Math. Richard Arratia, Béla Bollobás, Don Coppersmith, Gregory B. Sorkin
2000	J	`jnl`	Judicious Partitions of 3-uniform Hypergraphs. Eur. J. Comb. Béla Bollobás, Alex D. Scott
2000	J	`jnl`	Local and Mean Ramsey Numbers for Trees. J. Comb. Theory B Béla Bollobás, Alexandr V. Kostochka, Richard H. Schelp
2000	J	`jnl`	On a conjecture involving cycle-complete graph Ramsey numbers. Australas. J Comb. Béla Bollobás, Chula J. Jayawardene, Jiansheng Yang, Yi Ru Huang, Cecil C. Rousseau, Ke Min Zhang
2000	J	`jnl`	Polychromatic polynomials. Discret. Math. Béla Bollobás, Oliver Riordan
2000	J	`jnl`	The Speed of Hereditary Properties of Graphs. J. Comb. Theory B József Balogh, Béla Bollobás, David Weinreich
2000	J	`jnl`	The Structure of Hereditary Properties and Colourings of Random Graphs. Comb. Béla Bollobás, Andrew Thomason
2000	A*	`conf`	The interlace polynomial: a new graph polynomial. SODA Richard Arratia, Béla Bollobás, Gregory B. Sorkin
1999	J	`jnl`	Closure and Hamiltonian-connectivity of claw-free graphs. Discret. Math. Béla Bollobás, Oliver Riordan, Zdenek Ryjácek, Akira Saito, Richard H. Schelp
1999	J	`jnl`	Counting Boundary Paths for Oriented Percolation Clusters. Random Struct. Algorithms Paul Balister, Béla Bollobás, Alan Stacey
1999	J	`jnl`	Exact Bounds for Judicious Partitions of Graphs. Comb. Béla Bollobás, Alex D. Scott
1999	J	`jnl`	Extremal graphs for weights. Discret. Math. Béla Bollobás, Paul Erdös, Amites Sarkar
1999	J	`jnl`	Geometrical Techniques for Estimating Numbers of Linear Extensions. Eur. J. Comb. Béla Bollobás, Graham R. Brightwell, Alexander F. Sidorenko
1999	J	`jnl`	Turán's Theorem and Maximal Degrees. J. Comb. Theory B Béla Bollobás
1999	J	`jnl`	Weakly Pancyclic Graphs. J. Comb. Theory B Béla Bollobás, Andrew Thomason
1998	J	`jnl`	Colorings generated by monotone properties. Random Struct. Algorithms Béla Bollobás, Oliver Riordan
1998	J	`jnl`	Graphs of Extremal Weights. Ars Comb. Béla Bollobás, Paul Erdös
1998	J	`jnl`	On some conjectures of Graffiti. Discret. Math. Béla Bollobás, Oliver Riordan
1998	J	`jnl`	Paul Erdös and probability theory. Random Struct. Algorithms Béla Bollobás
1998	J	`jnl`	Proof of a Conjecture of Mader, Erdös and Hajnal on Topological Complete Subgraphs. Eur. J. Comb. Béla Bollobás, Andrew Thomason
1998	J	`jnl`	The oriented cycle game. Discret. Math. Béla Bollobás, Tamás Szabó
1997	J	`jnl`	Independent sets and repeated degrees. Discret. Math. Béla Bollobás, Alex D. Scott
1997	J	`jnl`	Judicious Partitions of Hypergraphs. J. Comb. Theory A Béla Bollobás, Alex D. Scott
1997	J	`jnl`	Matchings and Paths in the Cube. Discret. Appl. Math. Béla Bollobás, Imre Leader
1997	J	`jnl`	On a problem of Erdös and Graham. Discret. Math. Béla Bollobás, Norbert Hegyvári, Guoping Jin
1997	J	`jnl`	On the girth of hamiltonian weakly pancyclic graphs. J. Graph Theory Béla Bollobás, Andrew Thomason
1997	J	`jnl`	Random Walks and Electrical Resistances in Products of Graphs. Discret. Appl. Math. Béla Bollobás, Graham R. Brightwell
1997	J	`jnl`	The Structure of Random Graph Orders. SIAM J. Discret. Math. Béla Bollobás, Graham R. Brightwell
1997	—	`conf`	Time-Series Similarity Problems and Well-Separated Geometric Sets. SCG Béla Bollobás, Gautam Das, Dimitrios Gunopulos, Heikki Mannila
1996	J	`jnl`	A Proof of a Conjecture of Bondy Concerning Paths in Weighted Digraphs. J. Comb. Theory B Béla Bollobás, Alex D. Scott
1996	J	`jnl`	Degree multiplicities and independent sets in K Discret. Math. Béla Bollobás
1996	J	`jnl`	Highly Linked Graphs. Comb. Béla Bollobás, Andrew Thomason
1996	J	`jnl`	On the Best Case of Heapsort. J. Algorithms Béla Bollobás, Trevor I. Fenner, Alan M. Frieze
1996	J	`jnl`	Sums in the grid. Discret. Math. Béla Bollobás, Imre Leader
1996	J	`jnl`	Turán-Ramsey problems. Discret. Math. Béla Bollobás
1995	J	`jnl`	Connectivity Properties of Random Subgraphs of the Cube. Random Struct. Algorithms Béla Bollobás, Yoshiharu Kohayakawa, Tomasz Luczak
1995	J	`jnl`	Defect Sauer Results. J. Comb. Theory A Béla Bollobás, A. J. Radcliffe
1995	J	`jnl`	Generalized Chromatic Numbers of Random Graphs. Random Struct. Algorithms Béla Bollobás, Andrew Thomason
1995	J	`jnl`	The maximal number of induced Graphs Comb. Béla Bollobás, Yoshimi Egawa, Andrew J. Harris, Guoping Jin
1994	J	`jnl`	An Extension of the Erdös-Stone Theorem. Comb. Béla Bollobás, Yoshiharu Kohayakawa
1994	J	`jnl`	Improved Upper Bounds for the Critical Probability of Oriented Percolation in Two Dimensions. Random Struct. Algorithms Paul Balister, Béla Bollobás, Alan Stacey
1994	J	`jnl`	On the Diameter and Radius of Random Subgraphs of the Cube. Random Struct. Algorithms Béla Bollobás, Yoshiharu Kohayakawa, Tomasz Luczak
1994	J	`jnl`	Percolation in High Dimensions. Eur. J. Comb. Béla Bollobás, Yoshiharu Kohayakawa
1993	J	`jnl`	Clique coverings of the edges of a random graph. Comb. Béla Bollobás, Paul Erdös, Joel Spencer, Douglas B. West
1993	J	`jnl`	Cycles through specified vertices. Comb. Béla Bollobás, Graham R. Brightwell
1993	J	`jnl`	Maximal sets of given diameter in the grid and the torus. Discret. Math. Béla Bollobás, Imre Leader
1993	J	`jnl`	Probabilistic Analysis of Disjoint Set Union Algorithms. SIAM J. Comput. Béla Bollobás, István Simon
1992	J	`jnl`	A travelling salesman problem in the k-dimensional unit cube. Oper. Res. Lett. Béla Bollobás, Amram Meir
1992	J	`jnl`	The Evaluation of Random Subgraphs of the Cube. Random Struct. Algorithms Béla Bollobás, Yoshiharu Kohayakawa, Tomasz Luczak
1991	—	`conf`	An extremal function for the achromatic number. Graph Structure Theory Béla Bollobás, Bruce A. Reed, Andrew Thomason
1991	J	`jnl`	Compressions and isoperimetric inequalities. J. Comb. Theory A Béla Bollobás, Imre Leader
1991	J	`jnl`	Edge-isoperimetric inequalities in the grid. Comb. Béla Bollobás, Imre Leader
1991	J	`jnl`	Graphs without large triangle free subgraphs. Discret. Math. Béla Bollobás, H. R. Hind
1991	J	`jnl`	Isoperimetric inequalities and fractional set systems. J. Comb. Theory A Béla Bollobás, Imre Leader
1991	J	`jnl`	Spanning Maximal Planar Subgraphs of Random Graphs. Random Struct. Algorithms Béla Bollobás, Alan M. Frieze
1990	J	`jnl`	Almost every graph has reconstruction number three. J. Graph Theory Béla Bollobás
1990	J	`jnl`	An Isoperimetric Inequality on the Discrete Torus. SIAM J. Discret. Math. Béla Bollobás, Imre Leader
1990	J	`jnl`	Complete Matchings in Random Subgraphs on the Cube. Random Struct. Algorithms Béla Bollobás
1990	J	`jnl`	Exact Face-isoperimetric Inequalities. Eur. J. Comb. Béla Bollobás, Imre Leader
1990	J	`jnl`	Isoperimetric Inequalities for Faces of the Cube and the Grid. Eur. J. Comb. Béla Bollobás, A. J. Radcliffe
1990	J	`jnl`	On generalised minimal domination parameters for paths. Discret. Math. Béla Bollobás, Ernest J. Cockayne, Christina M. Mynhardt
1990	J	`jnl`	Parallel Selection with High Probability. SIAM J. Discret. Math. Béla Bollobás, Graham R. Brightwell
1990	J	`jnl`	Powers of Hamilton cycles in tournaments. J. Comb. Theory B Béla Bollobás, Roland Häggkvist
1990	J	`jnl`	The Cost Distribution of Clustering in Random Probing J. ACM Béla Bollobás, Andrei Z. Broder, István Simon
1989	J	`jnl`	A new upper bound for the list chromatic number. Discret. Math. Béla Bollobás, H. R. Hind
1989	J	`jnl`	First cycles in random directed graph processes. Discret. Math. Béla Bollobás, Steen Rasmussen
1989	J	`jnl`	Graphs with a small number of distinct induced subgraphs. Discret. Math. Noga Alon, Béla Bollobás
1989	J	`jnl`	Long cycles in graphs with no subgraphs of minimal degree 3. Discret. Math. Béla Bollobás, Graham R. Brightwell
1989	J	`jnl`	Paul Erdös at seventy-five. Discret. Math. Béla Bollobás
1988	J	`jnl`	Sorting in rounds. Discret. Math. Béla Bollobás
1988	J	`jnl`	The Diameter of a Cycle Plus a Random Matching. SIAM J. Discret. Math. Béla Bollobás, Fan R. K. Chung
1988	J	`jnl`	The Isoperimetric Number of Random Regular Graphs. Eur. J. Comb. Béla Bollobás
1988	J	`jnl`	The chromatic number of random graphs. Comb. Béla Bollobás
1988	J	`jnl`	The number of unrelated partitions. J. Comb. Theory A Béla Bollobás
1988	J	`jnl`	Transitive Orientations of Graphs. SIAM J. Comput. Béla Bollobás, Graham R. Brightwell
1987	J	`jnl`	An algorithm for finding Hamilton cycles in a random graph. Comb. Béla Bollobás, Trevor I. Fenner, Alan M. Frieze
1987	J	`jnl`	Threshold functions. Comb. Béla Bollobás, Andrew Thomason
1986	—	`book`	Extremal graph theory with emphasis on probabilistic methods. Béla Bollobás
1986	J	`jnl`	The maximal number of induced complete bipartite graphs. Discret. Math. Béla Bollobás, Chie Nara, Shun-ichi Tachibana
1986	J	`jnl`	The number of matchings in random regular graphs and bipartite graphs. J. Comb. Theory B Béla Bollobás, Brendan D. McKay
1985	A*	`conf`	An Algorithm for Finding Hamilton Cycles in a Random Graph STOC Béla Bollobás, Trevor I. Fenner, Alan M. Frieze
1985	J	`jnl`	List-colourings of graphs. Graphs Comb. Béla Bollobás, Andrew J. Harris
1985	A*	`conf`	On the Expected Behaviour of Disjoint Set Union Algorithms STOC Béla Bollobás, István Simon
1985	J	`jnl`	Regular factors of regular graphs. J. Graph Theory Béla Bollobás, Akira Saito, Nicholas C. Wormald
1985	J	`jnl`	Repeated Random Insertion into a Priority Queue. J. Algorithms Béla Bollobás, István Simon
1984	J	`jnl`	Diameters of random bipartite graphs. Comb. Béla Bollobás, Victor Klee
1984	J	`jnl`	Rotation numbers for unions of circuits. J. Graph Theory Béla Bollobás, Ernest J. Cockayne, Fang Zu Yao
1984	J	`jnl`	The irredundance number and maximum degree of a graph. Discret. Math. Béla Bollobás, Ernest J. Cockayne
1983	J	`jnl`	Almost all Regular Graphs are Hamiltonian. Eur. J. Comb. Béla Bollobás
1983	J	`jnl`	Equitable and proportional coloring of trees. J. Comb. Theory B Béla Bollobás, Richard K. Guy
1983	J	`jnl`	On 4-cycles in random bipartite tournaments. J. Graph Theory Béla Bollobás, Ove Frank, Michal Karonski
1983	J	`jnl`	On Helly families of maximal size. J. Comb. Theory B Béla Bollobás, Pierre Duchet
1983	J	`jnl`	Parallel sorting. Discret. Appl. Math. Béla Bollobás, Andrew Thomason
1983	J	`jnl`	Some remarks on packing trees. Discret. Math. Béla Bollobás
1982	J	`jnl`	Long paths in sparse random graphs. Comb. Béla Bollobás
1982	J	`jnl`	More rotation numbers for complete bipartite graphs. J. Graph Theory Béla Bollobás, Ernest J. Cockayne
1982	J	`jnl`	The diameter of random regular graphs. Comb. Béla Bollobás, Wenceslas Fernandez de la Vega
1982	J	`jnl`	Vertices of given degree in a random graph. J. Graph Theory Béla Bollobás
1981	J	`jnl`	Degree sequences of random graphs. Discret. Math. Béla Bollobás
1981	J	`jnl`	Dense neighbourhoods and Turán's theorem. J. Comb. Theory B Béla Bollobás, Andrew Thomason
1981	J	`jnl`	Graphs which Contain all Small Graphs. Eur. J. Comb. Béla Bollobás, Andrew Thomason
1981	J	`jnl`	Indestructive deletions of edges from graphs. J. Comb. Theory B Béla Bollobás, Donald L. Goldsmith, Douglas R. Woodall
1981	J	`jnl`	The size of connected hypergraphs with prescribed covering number. J. Comb. Theory B Béla Bollobás, Carsten Thomassen
1981	J	`jnl`	Topological cliques of random graphs. J. Comb. Theory B Béla Bollobás, Paul A. Catlin
1980	J	`jnl`	A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs. Eur. J. Comb. Béla Bollobás
1980	J	`jnl`	Hadwiger's Conjecture is True for Almost Every Graph. Eur. J. Comb. Béla Bollobás, Paul A. Catlin, Paul Erdös
1980	J	`jnl`	The distribution of the maximum degree of a random graph. Discret. Math. Béla Bollobás
1979	J	`jnl`	Graph-theoretic parameters concerning domination, independence, and irredundance. J. Graph Theory Béla Bollobás, Ernest J. Cockayne
1979	J	`jnl`	Helly Families of Maximal Size. J. Comb. Theory A Béla Bollobás, Pierre Duchet
1979	J	`jnl`	On graphs with equal edge connectivity and minimum degree. Discret. Math. Béla Bollobás
1979	J	`jnl`	Set colourings of graphs. Discret. Math. Béla Bollobás, Andrew Thomason
1978	J	`jnl`	Chromatic number, girth and maximal degree. Discret. Math. Béla Bollobás
1978	J	`jnl`	Packings of graphs and applications to computational complexity. J. Comb. Theory B Béla Bollobás, Stephen E. Eldridge
1978	J	`jnl`	The number of 1-factors in 2k-connected graphs. J. Comb. Theory B Béla Bollobás
1978	J	`jnl`	Uniquely colorable graphs. J. Comb. Theory B Béla Bollobás
1977	J	`jnl`	Extremal problems in graph theory. J. Graph Theory Béla Bollobás
1977	J	`jnl`	Semi-topological subgraphs. Discret. Math. Béla Bollobás
1976	J	`jnl`	Complete subgraphs are elusive. J. Comb. Theory B Béla Bollobás
1976	J	`jnl`	On a Ramsey-Turán type problem. J. Comb. Theory B Béla Bollobás, Paul Erdös
1976	J	`jnl`	On graphs with diameter 2. J. Comb. Theory B Béla Bollobás, Stephen E. Eldridge
1975	J	`jnl`	On complete subgraphs of r-chromatic graphs. Discret. Math. Béla Bollobás, Paul Erdös, Endre Szemerédi
1974	J	`jnl`	Three-graphs without two triples whose symmetric difference is contained in a third. Discret. Math. Béla Bollobás
1973	J	`jnl`	Sperner Systems Consisting of Pairs of Complementary Subsets. J. Comb. Theory A Béla Bollobás