Béla Bollobás

发表

Eliminating Cycles in the Discrete Torus

Béla Bollobás, Guy Kindler, Imre Leader, 2007, Algorithmica.

Graphs of Extremal Weights

Béla Bollobás, Paul Erdös, B. Bollobás, 1998, Ars Comb..

Threshold functions

Béla Bollobás, Andrew Thomason, B. Bollobás, 1987, Comb..

Three-graphs without two triples whose symmetric difference is contained in a third

Béla Bollobás, B. Bollobás, 1974, Discret. Math..

Hereditary properties of words

Béla Bollobás, József Balogh, 2005, RAIRO Theor. Informatics Appl..

Exploring hypergraphs with martingales

Béla Bollobás, Oliver Riordan, 2017, Random Struct. Algorithms.

Making Squares - Sieves, Smooth Numbers, Cores and Random Xorsat (Keynote Speakers)

Béla Bollobás, 2018, AofA.

Spread-out percolation in Rd

Béla Bollobás, Svante Janson, Oliver Riordan, 2007, Random Struct. Algorithms.

Clique coverings of the edges of a random graph

Béla Bollobás, Paul Erdös, Joel H. Spencer, 1993, Comb..

The number of k-SAT functions

Béla Bollobás, Graham R. Brightwell, 2003, Random Struct. Algorithms.

Contraction-Deletion Invariants for Graphs

Béla Bollobás, Oliver Riordan, Luke Pebody, 2000, J. Comb. Theory B.

Set colourings of graphs

Béla Bollobás, Andrew Thomason, B. Bollobás, 2006, Discret. Math..

Pentagons vs. triangles

Béla Bollobás, Ervin Györi, B. Bollobás, 2008, Discret. Math..

Repeated Degrees in Random Uniform Hypergraphs

Béla Bollobás, Paul N. Balister, Jenö Lehel, 2013, SIAM J. Discret. Math..

Probabilistic Analysis of Disjoint Set Union Algorithms

Béla Bollobás, István Simon, 1993, SIAM J. Comput..

Cycles through specified vertices

Béla Bollobás, Graham R. Brightwell, B. Bollobás, 1993, Comb..

The Interlace Polynomial of Graphs at - 1

Béla Bollobás, Paul N. Balister, Luke Pebody, 2002, Eur. J. Comb..

Joints in graphs

Béla Bollobás, Vladimir Nikiforov, 2008, Discret. Math..

Continuum percolation with steps in the square or the disc

Béla Bollobás, Paul N. Balister, Mark Walters, 2005, Random Struct. Algorithms.

Paul Erdős: Life and Work

Béla Bollobás, 2013, The Mathematics of Paul Erdős I.

Large deviations for mean field models of probabilistic cellular automata

Béla Bollobás, Robert Kozma, Paul N. Balister, 2006, Random Struct. Algorithms.

Extremal graph theory with emphasis on probabilistic methods

Béla Bollobás, B. Bollobás, 1986, CBMS-NSF regional conference series in applied mathematics.

Paul Erdös at seventy-five

Béla Bollobás, B. Bollobás, 1989, Discrete Mathematics.

Weakly Pancyclic Graphs

Béla Bollobás, Andrew Thomason, B. Bollobás, 1999, J. Comb. Theory, Ser. B.

Semi-topological subgraphs

Béla Bollobás, B. Bollobás, 1977, Discret. Math..

On a Ramsey-Turán type problem

Béla Bollobás, Paul Erdös, B. Bollobás, 1976, Journal of combinatorial theory. Series B (Print).

The Diameter of a Scale-Free Random Graph

Béla Bollobás, Oliver Riordan, B. Bollobás, 2004, Comb..

Long cycles in graphs with no subgraphs of minimal degree 3

Béla Bollobás, Graham R. Brightwell, B. Bollobás, 1989, Discret. Math..

Critical Probabilities of 1-Independent Percolation Models

Béla Bollobás, Paul N. Balister, 2012, Comb. Probab. Comput..

Diameters of random bipartite graphs

Béla Bollobás, Victor Klee, B. Bollobás, 1984, Comb..

On the Diameter and Radius of Random Subgraphs of the Cube

Yoshiharu Kohayakawa, Béla Bollobás, Tomasz Luczak, 1994, Random Struct. Algorithms.

Counting dense connected hypergraphs via the probabilistic method

Béla Bollobás, Oliver Riordan, 2018, Random Struct. Algorithms.

Packings of graphs and applications to computational complexity

Béla Bollobás, Stephen E. Eldridge, B. Bollobás, 1978, J. Comb. Theory, Ser. B.

Energy-latency tradeoff for in-network function computation in random networks

Béla Bollobás, Anima Anandkumar, Alan S. Willsky, 2011, 2011 Proceedings IEEE INFOCOM.

Sentry Selection in Sensor Networks: A Sufficient Condition for k Single Covers

Béla Bollobás, Martin Haenggi, Amites Sarkar, 2008 .

How Sharp is the Concentration of the Chromatic Number?

Béla Bollobás, 2004, Comb. Probab. Comput..

Closure and Hamiltonian-connectivity of claw-free graphs

Béla Bollobás, Richard H. Schelp, Zdenek Ryjácek, 1999, Discret. Math..

Line percolation

Jonathan Lee, Béla Bollobás, Paul N. Balister, 2018, Random Struct. Algorithms.

The distribution of the maximum degree of a random graph

Béla Bollobás, B. Bollobás, 1980, Discret. Math..

On graphs with equal edge connectivity and minimum degree

Béla Bollobás, B. Bollobás, 1979, Discret. Math..

Girth of sparse graphs

Endre Szemerédi, Béla Bollobás, B. Bollobás, 2002, J. Graph Theory.

Asymptotic normality of the size of the giant component in a random hypergraph

Béla Bollobás, Oliver Riordan, B. Bollobás, 2011, Random Struct. Algorithms.

The maximal number of inducedr-partite subgraphs

Béla Bollobás, Yoshimi Egawa, Guoping Jin, 1995, Graphs Comb..

Euler circuits and DNA sequencing by hybridization

Béla Bollobás, Don Coppersmith, Gregory B. Sorkin, 2000, Discret. Appl. Math..

A note on the Harris-Kesten Theorem

Béla Bollobás, Oliver Riordan, 2007, Eur. J. Comb..

A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs

Béla Bollobás, B. Bollobás, 1980, Eur. J. Comb..

The Phase Transition and Connectedness in Uniformly Grown Random Graphs

Béla Bollobás, Oliver Riordan, 2004, WAW.

Random Graphs and Branching Processes

Béla Bollobás, Oliver Riordan, B. Bollobás, 2008 .

Advances in graph theory

Béla Bollobás, 1978 .

Graph bootstrap percolation

Béla Bollobás, József Balogh, Robert Morris, 2011, Random Struct. Algorithms.

Books in graphs

Béla Bollobás, Vladimir Nikiforov, 2005, Eur. J. Comb..

Large joints in graphs

Béla Bollobás, Vladimir Nikiforov, B. Bollobás, 2010, Eur. J. Comb..

More rotation numbers for complete bipartite graphs

Béla Bollobás, Ernest J. Cockayne, B. Bollobás, 1982, J. Graph Theory.

Degree Distribution of the FKP Network Model

Béla Bollobás, Christian Borgs, Jennifer T. Chayes, 2003, ICALP.

Disjointly representing set systems

Béla Bollobás, Oliver Riordan, B. Bollobás, 2003, J. Comb. Theory, Ser. A.

Turán's Theorem and Maximal Degrees

Béla Bollobás, 1999, J. Comb. Theory, Ser. B.

Graphs which Contain all Small Graphs

Béla Bollobás, Andrew Thomason, B. Bollobás, 1981, Eur. J. Comb..

Fast transmission in ad hoc networks

Béla Bollobás, Martin Haenggi, Paul N. Balister, 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

The fine structure of octahedron-free graphs

Miklós Simonovits, Béla Bollobás, József Balogh, 2011, J. Comb. Theory, Ser. B.

Union-closed families of sets

Béla Bollobás, Tom Eccles, Igor Balla, 2013, J. Comb. Theory, Ser. A.

An Isoperimetric Inequality on the Discrete Torus

Béla Bollobás, Imre Leader, B. Bollobás, 1990, SIAM J. Discret. Math..

Introduction

Noga Alon, Béla Bollobás, 2010, Comb. Probab. Comput..

Graphs without large triangle free subgraphs

Béla Bollobás, H. R. Hind, B. Bollobás, 1991, Discret. Math..

Chromatic number, girth and maximal degree

Béla Bollobás, 1978, Discret. Math..

Independent sets and repeated degrees

Béla Bollobás, Alex D. Scott, 1997, Discret. Math..

On the Maximum Running Time in Graph Bootstrap Percolation

Béla Bollobás, Oliver Riordan, Julian Sahasrabudhe, 2017, Electron. J. Comb..

Random Graphs: Notation

Béla Bollobás, B. Bollobás, 2001 .

Set Systems with few Disjoint Pairs

Béla Bollobás, Imre Leader, 2003, Comb..

Isoperimetric Problems for r-sets

Béla Bollobás, Imre Leader, 2004, Comb. Probab. Comput..

Polychromatic polynomials

Béla Bollobás, Oliver Riordan, B. Bollobás, 2000, Discret. Math..

Alternating Knot Diagrams, Euler Circuits and the Interlace Polynomial

Béla Bollobás, Paul N. Balister, Oliver Riordan, 2001, Eur. J. Comb..

Improved Upper Bounds for the Critical Probability of Oriented Percolation in Two Dimensions

Béla Bollobás, Paul N. Balister, Alan Stacey, 1994, Random Struct. Algorithms.

Daisies and Other Turán Problems

Béla Bollobás, Imre Leader, Claudia Malvenuto, 2011, Combinatorics, Probability and Computing.

On a problem of Erdös and Graham

Béla Bollobás, Guoping Jin, Norbert Hegyvári, 1997, Discret. Math..

The irredundance number and maximum degree of a graph

Béla Bollobás, Ernest J. Cockayne, 1984, Discret. Math..

On covering by translates of a set

Béla Bollobás, Svante Janson, Oliver Riordan, 2009, Random Struct. Algorithms.

Complete subgraphs are elusive

Béla Bollobás, 1976, J. Comb. Theory, Ser. B.

The Oberwolfach Meeting On Combinatorics, Probability And Computing

Béla Bollobás, Ingo Wegener, 2003, Comb. Probab. Comput..

The Art of Mathematics - Coffee Time in Memphis

Béla Bollobás, 2006 .

Mathematical results on scale‐free random graphs

Béla Bollobás, Oliver Riordan, B. Bollobás, 2005 .

The Diameter of a Cycle Plus a Random Matching

Béla Bollobás, Fan Chung Graham, B. Bollobás, 1988, SIAM J. Discret. Math..

Rotation numbers for unions of circuits

Béla Bollobás, Ernest J. Cockayne, Fang Zu Yao, 1984, J. Graph Theory.

Random Walks and Electrical Resistances in Products of Graphs

Béla Bollobás, Graham Brightwell, 1997, Discret. Appl. Math..

Cover-Decomposition and Polychromatic Numbers

Béla Bollobás, David Pritchard, Thomas Rothvoß, 2010, SIAM J. Discret. Math..

On 4-cycles in random bipartite tournaments

Béla Bollobás, Michal Karonski, Ove Frank, 1983, J. Graph Theory.

Colorings generated by monotone properties

Béla Bollobás, Oliver Riordan, 1998, Random Struct. Algorithms.

On separating systems

Béla Bollobás, Alex D. Scott, B. Bollobás, 2007, Eur. J. Comb..

Equitable and proportional coloring of trees

Béla Bollobás, Richard K. Guy, B. Bollobás, 1983, J. Comb. Theory, Ser. B.

Frank Ramsey

Béla Bollobás, Andrew Thomason, 2003, Comb. Probab. Comput..

Powers of Hamilton cycles in tournaments

Béla Bollobás, Roland Häggkvist, B. Bollobás, 1990, J. Comb. Theory, Ser. B.

Hadwiger's Conjecture is True for Almost Every Graph

Béla Bollobás, Paul Erdös, Paul A. Catlin, 1980, Eur. J. Comb..

Multicoloured extremal problems

Béla Bollobás, Benny Sudakov, Peter Keevash, 2004, J. Comb. Theory, Ser. A.

Jigsaw percolation on random hypergraphs

Béla Bollobás, Christoph Koch, Mihyun Kang, 2016, J. Appl. Probab..

Intersections of hypergraphs

Béla Bollobás, Alex D. Scott, 2015, J. Comb. Theory, Ser. B.

On graphs with diameter 2

Béla Bollobás, Stephen E. Eldridge, 1976, J. Comb. Theory, Ser. B.

The Structure of Random Graph Orders

Béla Bollobás, Graham Brightwell, B. Bollobás, 1997, SIAM J. Discret. Math..

Special Issue on Ramsey Theory

Yoshiharu Kohayakawa, Béla Bollobás, Imre Leader, 2003, Combinatorics, Probability and Computing.

A Two-Variable Interlace Polynomial

Béla Bollobás, Gregory B. Sorkin, Richard Arratia, 2004, Comb..

Proving integrality gaps without knowing the linear program

Béla Bollobás, László Lovász, Sanjeev Arora, 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

Cliques and the spectral radius

Béla Bollobás, Vladimir Nikiforov, 2007, J. Comb. Theory, Ser. B.

Matchings and Paths in the Cube

Béla Bollobás, Imre Leader, 1997, Discret. Appl. Math..

Highly connected random geometric graphs

Béla Bollobás, Paul N. Balister, Amites Sarkar, 2009, Discret. Appl. Math..

The structure of almost all graphs in a hereditary property

Noga Alon, Béla Bollobás, József Balogh, 2009, J. Comb. Theory B.

Bootstrap Percolation in High Dimensions

Béla Bollobás, József Balogh, Robert Morris, 2009, Combinatorics, Probability and Computing.

Topological cliques of random graphs

Béla Bollobás, Paul A. Catlin, P. A. Catlin, 1981, J. Comb. Theory, Ser. B.

A Ramsey-type theorem for metric spaces and its applications for metrical task systems and related problems

Béla Bollobás, Yair Bartal, Manor Mendel, 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

Ramsey minimal graphs

Yoshiharu Kohayakawa, Béla Bollobás, Richard H. Schelp, 2001, J. Braz. Comput. Soc..

Introduction

Noga Alon, Béla Bollobás, 2009, Comb. Probab. Comput..

Ramsey-type theorems for metric spaces with applications to online problems

Béla Bollobás, Yair Bartal, Manor Mendel, 2004, J. Comput. Syst. Sci..

The generalized Randic index of trees

Béla Bollobás, Paul N. Balister, Stefanie Gerke, 2007, J. Graph Theory.

Paul Erdös and probability theory

Béla Bollobás, B. Bollobás, 1998, Random Struct. Algorithms.

Sharp thresholds and percolation in the plane

Béla Bollobás, Oliver Riordan, 2006, Random Struct. Algorithms.

Degree Powers in Graphs with Forbidden Subgraphs

Béla Bollobás, Vladimir Nikiforov, 2004, Electron. J. Comb..

Sorting in rounds

Béla Bollobás, 1988, Discret. Math..

Analytic Graph Theory

Béla Bollobás, Nicholas C. Wormald, Ralph J. Faudree, 2003, Handbook of Graph Theory.

The number of 1-factors in 2k-connected graphs

Béla Bollobás, 1978, J. Comb. Theory, Ser. B.

Shadows of ordered graphs

Béla Bollobás, Graham R. Brightwell, Robert Morris, 2009, J. Comb. Theory, Ser. A.

List-colourings of graphs

Béla Bollobás, Andrew J. Harris, B. Bollobás, 1985, Graphs Comb..

First cycles in random directed graph processes

Béla Bollobás, Steen Rasmussen, B. Bollobás, 1989, Discret. Math..

Connectivity of addable graph classes

Béla Bollobás, Paul N. Balister, Stefanie Gerke, 2008, J. Comb. Theory, Ser. B.

Random Hypergraph Irregularity

Béla Bollobás, Paul N. Balister, Jenö Lehel, 2016, SIAM J. Discret. Math..

Counting Boundary Paths for Oriented Percolation Clusters

Béla Bollobás, Paul N. Balister, Alan Stacey, 1999, Random Struct. Algorithms.

The oriented cycle game

Béla Bollobás, Tamás Szabó, B. Bollobás, 1998, Discret. Math..

The interlace polynomial: a new graph polynomial

Béla Bollobás, Gregory B. Sorkin, Richard Arratia, 2000, SODA '00.

Max k-cut and judicious k-partitions

Béla Bollobás, Alex D. Scott, 2010, Discret. Math..

The distribution of the root degree of a random permutation

Béla Bollobás, Boris G. Pittel, 2009, Comb..

The Evaluation of Random Subgraphs of the Cube

Yoshiharu Kohayakawa, Béla Bollobás, Tomasz Luczak, 1992, Random Struct. Algorithms.

Percolation in High Dimensions

Yoshiharu Kohayakawa, Béla Bollobás, 1994, Eur. J. Comb..

Slow emergence of the giant component in the growing m‐out graph

Béla Bollobás, Oliver Riordan, B. Bollobás, 2005, Random Struct. Algorithms.

Cover-Decomposition and Polychromatic Numbers

Béla Bollobás, David Pritchard, Thomas Rothvoß, 2011, ESA.

Set colourings of graphs

Béla Bollobás, Andrew Thomason, 1979, Discret. Math..

Percolation in Voronoi tilings

Béla Bollobás, Paul N. Balister, Anthony Quas, 2005, Random Struct. Algorithms.

Sums in the grid

Béla Bollobás, Imre Leader, B. Bollobás, 1996, Discret. Math..

Maximum cuts and judicious partitions in graphs without short cycles

Noga Alon, Béla Bollobás, Benny Sudakov, 2003, J. Comb. Theory B.

Generalized Chromatic Numbers of Random Graphs

Béla Bollobás, Andrew Thomason, 1995, Random Struct. Algorithms.

Basic concepts and results

Béla Bollobás, Oliver Riordan, 2006 .

Walks and paths in trees

Béla Bollobás, Mykhaylo Tyomkyn, B. Bollobás, 2010, J. Graph Theory.

On some conjectures of Graffiti

Béla Bollobás, Oliver Riordan, 1998, Discret. Math..

An algorithm for finding Hamilton cycles in random graphs

Alan M. Frieze, Béla Bollobás, Trevor I. Fenner, 1985, STOC '85.

Majority Bootstrap Percolation on the Hypercube

Béla Bollobás, József Balogh, Robert Morris, 2007, Combinatorics, Probability and Computing.

Paths of length four

Béla Bollobás, Amites Sarkar, B. Bollobás, 2003, Discret. Math..

Measures on monotone properties of graphs

Béla Bollobás, József Balogh, David Weinreich, 2002, Discret. Appl. Math..

Defect Sauer Results

Béla Bollobás, A. J. Radcliffe, B. Bollobás, 1995, J. Comb. Theory A.

Turán-Ramsey problems

Béla Bollobás, B. Bollobás, 1996, Discret. Math..

Dense neighbourhoods and Turán's theorem

Béla Bollobás, Andrew Thomason, 1981, J. Comb. Theory, Ser. B.

Vertices of given degree in a random graph

Béla Bollobás, B. Bollobás, 1982, J. Graph Theory.

On Helly families of maximal size

Béla Bollobás, Pierre Duchet, 1983, J. Comb. Theory, Ser. B.

Connectivity Properties of Random Subgraphs of the Cube

Yoshiharu Kohayakawa, Béla Bollobás, Tomasz Luczak, 1995, Random Struct. Algorithms.

Directed scale-free graphs

Béla Bollobás, Christian Borgs, Jennifer T. Chayes, 2003, SODA '03.

Spanning Maximal Planar Subgraphs of Random Graphs

Alan M. Frieze, Béla Bollobás, B. Bollobás, 1991, Random Struct. Algorithms.

Judicious Partitions of Hypergraphs

Béla Bollobás, Alex D. Scott, B. Bollobás, 1997, J. Comb. Theory, Ser. A.

Random Graphs, Second Edition

Béla Bollobás, B. Bollobás, 2001, Cambridge Studies in Advanced Mathematics.

Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at least k

Alan M. Frieze, Béla Bollobás, Trevor I. Fenner, 2000, J. Graph Theory.

Graph-theoretic parameters concerning domination, independence, and irredundance

Béla Bollobás, Ernest J. Cockayne, 1979, J. Graph Theory.

Graphs with large maximum degree containing no odd cycles of a given length

Béla Bollobás, Richard H. Schelp, Paul N. Balister, 2003, J. Comb. Theory, Ser. B.

Sparse random graphs with clustering

Béla Bollobás, Svante Janson, Oliver Riordan, 2008, Random Struct. Algorithms.

The unlabelled speed of a hereditary graph property

Béla Bollobás, Michael E. Saks, József Balogh, 2009, J. Comb. Theory, Ser. B.

Edge-isoperimetric inequalities in the grid

Béla Bollobás, Imre Leader, 1991, Comb..

Degree Powers in Graphs: The Erdős–Stone Theorem

Béla Bollobás, Vladimir Nikiforov, B. Bollobás, 2012, Combinatorics, Probability and Computing.

Union of shadows

Béla Bollobás, Imre Leader, B. Bollobás, 2003, Theor. Comput. Sci..

Highly linked graphs

Béla Bollobás, Andrew Thomason, B. Bollobás, 1996, Comb..

Degree sequences of random graphs

Béla Bollobás, B. Bollobás, 1981, Discret. Math..

Intersections of random hypergraphs and tournaments

Béla Bollobás, Alex D. Scott, B. Bollobás, 2015, Eur. J. Comb..

Hermitian matrices and graphs: singular values and discrepancy

Béla Bollobás, Vladimir Nikiforov, 2004, Discret. Math..

Eigenvalues of subgraphs of the cube

Jonathan Lee, Béla Bollobás, Shoham Letzter, 2016, Eur. J. Comb..

Intersections of graphs

Béla Bollobás, Alex D. Scott, B. Bollobás, 2011, J. Graph Theory.

Some remarks on packing trees

Béla Bollobás, B. Bollobás, 1983, Discret. Math..

Cops and robbers in a random graph

Béla Bollobás, Imre Leader, Gábor Kun, 2013, J. Comb. Theory, Ser. B.

On the girth of hamiltonian weakly pancyclic graphs

Béla Bollobás, Andrew Thomason, 1997, J. Graph Theory.

Percolation on dual lattices with k-fold symmetry

Béla Bollobás, Oliver Riordan, 2008, Random Struct. Algorithms.

Monotone Cellular Automata in a Random Environment

Béla Bollobás, Paul Smith, Andrew J. Uzzell, 2012, Combinatorics, Probability and Computing.

Longest common extension

Béla Bollobás, Shoham Letzter, 2018, Eur. J. Comb..

Pair dominating graphs

Béla Bollobás, Paul N. Balister, 2006, Eur. J. Comb..

The typical structure of graphs without given excluded subgraphs

Miklós Simonovits, Béla Bollobás, József Balogh, 2009, Random Struct. Algorithms.

Connectivity of a Gaussian network

Béla Bollobás, Paul N. Balister, Amites Sarkar, 2008, Int. J. Ad Hoc Ubiquitous Comput..

A note on generalized chromatic number and generalized girth

Béla Bollobás, Douglas B. West, B. Bollobás, 1998, Discret. Math..

Graph Theory. Proceedings of the Conference on Graph Theory, Cambridge

Béla Bollobás, 1982 .

Separating systems and oriented graphs of diameter two

Béla Bollobás, Alex D. Scott, 2007, J. Comb. Theory, Ser. B.

Degree multiplicities and independent sets in K4-free graphs

Béla Bollobás, B. Bollobás, 1996, Discret. Math..

The Speed of Hereditary Properties of Graphs

Béla Bollobás, József Balogh, David Weinreich, 2000, J. Comb. Theory B.

The phase transition in inhomogeneous random graphs

Béla Bollobás, Svante Janson, Oliver Riordan, 2007, Random Struct. Algorithms.

Introduction

Béla Bollobás, Imre Leader, Paul N. Balister, 2018, Comb. Probab. Comput..

Almost all Regular Graphs are Hamiltonian

Béla Bollobás, B. Bollobás, 1983, European journal of combinatorics (Print).

Sparse distance preservers and additive spanners

Béla Bollobás, Michael Elkin, Don Coppersmith, 2003, SODA '03.

Interference percolation

Béla Bollobás, Paul N. Balister, 2014, Random Struct. Algorithms.

The Isoperimetric Number of Random Regular Graphs

Béla Bollobás, B. Bollobás, 1988, Eur. J. Comb..

Exact Bounds for Judicious Partitions of Graphs

Béla Bollobás, Alex D. Scott, B. Bollobás, 1999, Comb..

Isoperimetric Inequalities for Faces of the Cube and the Grid

Béla Bollobás, A. J. Radcliffe, 1990, Eur. J. Comb..

A travelling salesman problem in the k-dimensional unit cube

Béla Bollobás, A. Meir, 1992, Oper. Res. Lett..

The chromatic number of random graphs

Béla Bollobás, B. Bollobás, 1988, Comb..

A new upper bound for the list chromatic number

Béla Bollobás, H. R. Hind, 1989, Discret. Math..

Neuropercolation: A Random Cellular Automata Approach to Spatio-temporal Neurodynamics

Béla Bollobás, Robert Kozma, Paul N. Balister, 2004, ACRI.

Extremal problems in graph theory

Béla Bollobás, B. Bollobás, 1977, J. Graph Theory.

Catching a fast robber on the grid

Béla Bollobás, Paul N. Balister, Bhargav P. Narayanan, 2017, J. Comb. Theory, Ser. A.

Sperner Systems Consisting of Pairs of Complementary Subsets

Béla Bollobás, B. Bollobás, 1973, J. Comb. Theory, Ser. A.

The size of connected hypergraphs with prescribed covering number

Béla Bollobás, Carsten Thomassen, B. Bollobás, 1981, J. Comb. Theory, Ser. B.

Random Graphs

Béla Bollobás, B. Bollobás, 1985 .

The Threshold for Jigsaw Percolation on Random Graphs

Béla Bollobás, Paul Smith, Oliver Riordan, 2017, Electron. J. Comb..

The degree sequence of a scale‐free random graph process

Béla Bollobás, Joel H. Spencer, Oliver Riordan, 2001, Random Struct. Algorithms.

A jump to the bell number for hereditary graph properties

Béla Bollobás, József Balogh, David Weinreich, 2005, J. Comb. Theory, Ser. B.

The consequences of Zipf's law for syntax and symbolic reference

Béla Bollobás, Oliver Riordan, Ramon Ferrer i Cancho, 2005, Proceedings of the Royal Society B: Biological Sciences.

The phase transition in the uniformly grown random graph has infinite order

Béla Bollobás, Svante Janson, Oliver Riordan, 2005, Random Struct. Algorithms.

Proof of a Conjecture of Mader, Erdös and Hajnal on Topological Complete Subgraphs

Béla Bollobás, Andrew Thomason, B. Bollobás, 1998, Eur. J. Comb..

Complete Matchings in Random Subgraphs on the Cube

Béla Bollobás, 1990, Random Struct. Algorithms.

Local and Mean Ramsey Numbers for Trees

Béla Bollobás, Richard H. Schelp, Alexandr V. Kostochka, 2000, J. Comb. Theory, Ser. B.

Judicious Partitions of 3-uniform Hypergraphs

Béla Bollobás, Alex D. Scott, 2000, Eur. J. Comb..

On complete subgraphs of r-chromatic graphs

Endre Szemerédi, Béla Bollobás, Paul Erdös, 1975, Discret. Math..

Phase transitions in the neuropercolation model of neural populations with mixed local and non-local interactions

Béla Bollobás, Robert Kozma, Paul N. Balister, 2005, Biological Cybernetics.

Constrained Graph Processes

Béla Bollobás, Oliver Riordan, B. Bollobás, 2000, Electron. J. Comb..

Problems and results on judicious partitions

Béla Bollobás, Alex D. Scott, B. Bollobás, 2002, Random Struct. Algorithms.

Hereditary properties of partitions, ordered graphs and ordered hypergraphs

Béla Bollobás, József Balogh, Robert Morris, 2006, Eur. J. Comb..

The number of graphs with large forbidden subgraphs

Béla Bollobás, Vladimir Nikiforov, B. Bollobás, 2010, Eur. J. Comb..

Evaluations of the Circuit Partition Polynomial

Béla Bollobás, B. Bollobás, 2002, J. Comb. Theory, Ser. B.

Projections, entropy and sumsets

Béla Bollobás, Paul N. Balister, B. Bollobás, 2007, Comb..

Almost every graph has reconstruction number three

Béla Bollobás, 1990, J. Graph Theory.

On the Value of a Random Minimum Weight Steiner Tree

Béla Bollobás, Benny Sudakov, David Gamarnik, 2004, Comb..

Disjoint induced subgraphs of the same order and size

Béla Bollobás, Bhargav P. Narayanan, Alex D. Scott, 2015, Eur. J. Comb..

Parallel sorting

Béla Bollobás, Andrew Thomason, 1983, Discret. Appl. Math..

Judicious partitions of bounded‐degree graphs

Béla Bollobás, Alex D. Scott, B. Bollobás, 2004, J. Graph Theory.

Hereditary and Monotone Properties of Graphs

Béla Bollobás, Andrew Thomason, B. Bollobás, 2013, The Mathematics of Paul Erdős II.

Graph Theory: An Introductory Course

Béla Bollobás, B. Bollobás, 1980, The Mathematical Gazette.

Max Cut for Random Graphs with a Planted Partition

Béla Bollobás, Alex D. Scott, B. Bollobás, 2004, Combinatorics, Probability and Computing.

The Dimension of Random Graph Orders

Béla Bollobás, Graham R. Brightwell, 2013, The Mathematics of Paul Erdős II.

The scaling window of the 2‐SAT transition

Béla Bollobás, David Bruce Wilson, Christian Borgs, 1999, Random Struct. Algorithms.

The Sum of Degrees in Cliques

Béla Bollobás, Vladimir Nikiforov, 2005, Electron. J. Comb..

Robustness and Vulnerability of Scale-Free Random Graphs

Béla Bollobás, Oliver Riordan, B. Bollobás, 2004, Internet Math..

The Structure of Hereditary Properties and Colourings of Random Graphs

Béla Bollobás, Andrew Thomason, B. Bollobás, 2000, Comb..

Handbook of Large-Scale Random Networks: Bolyai Society Mathematical Studies

Béla Bollobás, Robert Kozma, Dezso Miklos, 2009 .

Coupling Scale-Free and Classical Random Graphs

Béla Bollobás, Oliver Riordan, B. Bollobás, 2004, Internet Math..

Cycles in Dense Graphs

Béla Bollobás, 1986 .

Random Graphs: Preface to the Second Edition

Béla Bollobás, B. Bollobás, 2001 .

An extremal function for the achromatic number

Bruce A. Reed, Béla Bollobás, Andrew Thomason, 1991, Graph Structure Theory.

Eliminating Cycles in the Discrete Torus

Ryan O'Donnell, Béla Bollobás, Guy Kindler, 2006, LATIN.

Graphs and Hermitian matrices: eigenvalue interlacing

Béla Bollobás, Vladimir Nikiforov, B. Bollobás, 2004, Discret. Math..

Proving Integrality Gaps without Knowing the Linear Program

Béla Bollobás, László Lovász, Sanjeev Arora, 2006, Theory Comput..

An extension of the Erdős-Stone theorem

Yoshiharu Kohayakawa, Béla Bollobás, B. Bollobás, 1994, Comb..

A coding problem for pairs of subsets

Zoltán Füredi, Béla Bollobás, Imre Leader, 2003, Electron. Notes Discret. Math..

Uniquely colorable graphs

Béla Bollobás, B. Bollobás, 1978, J. Comb. Theory, Ser. B.

The number of matchings in random regular graphs and bipartite graphs

Brendan D. McKay, Béla Bollobás, B. Bollobás, 1986, J. Comb. Theory, Ser. B.

Counting Connected Hypergraphs via the Probabilistic Method

Béla Bollobás, Oliver Riordan, 2016, Comb. Probab. Comput..

Long paths in sparse random graphs

Béla Bollobás, 1982, Comb..

Repeated Random Insertion into a Priority Queue

Béla Bollobás, Istvan Simon, B. Bollobás, 1985, J. Algorithms.

Turán Densities of Some Hypergraphs Related to Kk+1k

Béla Bollobás, Yi Zhao, József Balogh, 2012, SIAM J. Discret. Math..

Modern Graph Theory

Béla Bollobás, B. Bollobás, 2002, Graduate Texts in Mathematics.

Extremal graphs for weights

Béla Bollobás, Paul Erdös, Amites Sarkar, 1999, Discret. Math..

Multi-path Routing Metrics for Reliable Wireless Mesh Routing Topologies pdf

Karl Henrik Johansson, Béla Bollobás, S. Shankar Sastry, 2011, ArXiv.

Line-of-Sight Percolation

Béla Bollobás, Svante Janson, Oliver Riordan, 2009, Comb. Probab. Comput..

The number of graphs without forbidden subgraphs

Miklós Simonovits, Béla Bollobás, József Balogh, 2004, J. Comb. Theory B.

The Diameter of Graphs: a survey

Béla Bollobás, Jean-Claude Bermond, B. Bollobás, 1981 .

The cost distribution of clustering in random probing

Béla Bollobás, Andrei Z. Broder, István Simon, 1990, JACM.

Partial Shadows of Set Systems

Béla Bollobás, Tom Eccles, 2015, Comb. Probab. Comput..

Compressions and isoperimetric inequalities

Béla Bollobás, Imre Leader, B. Bollobás, 1990, J. Comb. Theory, Ser. A.

Regular subgraphs of random graphs

Béla Bollobás, Jacques Verstraëte, Jeong Han Kim, 2006, Random Struct. Algorithms.

Reliable density estimates for coverage and connectivity in thin strips of finite length

Béla Bollobás, Paul N. Balister, Amites Sarkar, 2007, MobiCom '07.

A Proof of a Conjecture of Bondy Concerning Paths in Weighted Digraphs

Béla Bollobás, Alex D. Scott, B. Bollobás, 1996, J. Comb. Theory, Ser. B.

Linear algebra and bootstrap percolation

Béla Bollobás, József Balogh, Oliver Riordan, 2012, J. Comb. Theory, Ser. A.

Graphs and Groups

Béla Bollobás, 1979 .

Barrier Coverage

Béla Bollobás, Paul N. Balister, Amites Sarkar, 2016, Random Struct. Algorithms.

Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs

Béla Bollobás, Paul N. Balister, Karen Gunderson, 2016, Eur. J. Comb..

A small probabilistic universal set of starting points for finding roots of complex polynomials by Newton's method

Béla Bollobás, Dierk Schleicher, Malte Lackmann, 2010, Math. Comput..

Game domination number

Noga Alon, Béla Bollobás, József Balogh, 2002, Discret. Math..

Sentry selection in sensor networks: theory and algorithms

Béla Bollobás, Martin Haenggi, Paul N. Balister, 2017, Int. J. Sens. Networks.

Monotone Graph Limits and Quasimonotone Graphs

Béla Bollobás, Svante Janson, Oliver Riordan, 2011, Internet Math..

An old approach to the giant component problem

Béla Bollobás, Oliver Riordan, B. Bollobás, 2012, J. Comb. Theory, Ser. B.

Bond percolation with attenuation in high dimensional Voronoĭ tilings

Béla Bollobás, Paul N. Balister, B. Bollobás, 2010, Random Struct. Algorithms.

Indestructive deletions of edges from graphs

Béla Bollobás, Douglas R. Woodall, Donald L. Goldsmith, 1981, J. Comb. Theory, Ser. B.

Packing d-degenerate graphs

Béla Bollobás, Alexandr V. Kostochka, Kittikorn Nakprasit, 2008, J. Comb. Theory, Ser. B.

On generalised minimal domination parameters for paths

Béla Bollobás, Ernest J. Cockayne, Christina M. Mynhardt, 1990, Discret. Math..

Dense subgraphs in random graphs

Béla Bollobás, Paul N. Balister, Julian Sahasrabudhe, 2018, Discret. Appl. Math..

The time of bootstrap percolation with dense initial sets for all thresholds

Béla Bollobás, Paul Smith, Andrew J. Uzzell, 2012, Random Struct. Algorithms.

A Simple Branching Process Approach to the Phase Transition in Gn, p

Béla Bollobás, Oliver Riordan, B. Bollobás, 2012, Electron. J. Comb..

The Penultimate Rate of Growth for Graph Properties

Béla Bollobás, József Balogh, David Weinreich, 2001, Eur. J. Comb..

Maximal sets of given diameter in the grid and the torus

Béla Bollobás, Imre Leader, 1993, Discret. Math..

Transitive Orientations of Graphs

Béla Bollobás, Graham R. Brightwell, 1988, SIAM J. Comput..

Sparse graphs: Metrics and random models

Béla Bollobás, Oliver Riordan, B. Bollobás, 2008, Random Struct. Algorithms.

The Angel and the Devil in three dimensions

Béla Bollobás, Imre Leader, 2006, J. Comb. Theory, Ser. A.

How many graphs are unions of k-cliques?

Béla Bollobás, Graham R. Brightwell, 2006, J. Graph Theory.

Reliable Density Estimates for Achieving Coverage and Connectivity in Thin Strips of Finite Length

Béla Bollobás, Amites Sarkar, Paul Balister, 2007, ACM/IEEE International Conference on Mobile Computing and Networking.

Regular factors of regular graphs

Béla Bollobás, Akira Saito, Nicholas C. Wormald, 1985, J. Graph Theory.

Helly Families of Maximal Size

Béla Bollobás, Pierre Duchet, B. Bollobás, 1979, J. Comb. Theory, Ser. A.

Integer sets with prescribed pairwise differences being distinct

Béla Bollobás, Oleg Pikhurko, 2005, Eur. J. Comb..

On the stability of the Erdős-Ko-Rado theorem

Béla Bollobás, Andrei M. Raigorodskii, Bhargav P. Narayanan, 2016, J. Comb. Theory, Ser. A.

Degree distribution of the FKP network model

Béla Bollobás, Christian Borgs, Jennifer T. Chayes, 2003, Theor. Comput. Sci..

Unavoidable Traces Of Set Systems

Béla Bollobás, József Balogh, 2005, Comb..

The number of unrelated partitions

Béla Bollobás, B. Bollobás, 1988, J. Comb. Theory, Ser. A.

Metric Dimension for Random Graphs

Béla Bollobás, Dieter Mitsche, Pawel Pralat, 2012, Electron. J. Comb..

On the Best Case of Heapsort

Alan M. Frieze, Béla Bollobás, Trevor I. Fenner, 1996, J. Algorithms.

On a conjecture involving cycle-complete graph Ramsey numbers

Béla Bollobás, Cecil C. Rousseau, Jiansheng Yang, 2000, Australas. J Comb..

The interlace polynomial of a graph

Béla Bollobás, Gregory B. Sorkin, Richard Arratia, 2004, J. Comb. Theory, Ser. B.

Isoperimetric inequalities and fractional set systems

Béla Bollobás, Imre Leader, 1991, J. Comb. Theory, Ser. A.

Maximum directed cuts in acyclic digraphs

Noga Alon, Béla Bollobás, András Gyárfás, 2007, J. Graph Theory.

The maximal number of induced complete bipartite graphs

Béla Bollobás, Chie Nara, Shun-ichi Tachibana, 1986, Discret. Math..

Random majority percolation

Béla Bollobás, Paul N. Balister, Mark Walters, 2010, Random Struct. Algorithms.

Packing random graphs and hypergraphs

Béla Bollobás, Svante Janson, Alex D. Scott, 2017, Random Struct. Algorithms.

Hereditary Properties of Tournaments

Béla Bollobás, József Balogh, Robert Morris, 2007, Electron. J. Comb..

On the expected behavior of disjoint set union algorithms

Béla Bollobás, István Simon, B. Bollobás, 1985, STOC '85.

Highly connected monochromatic subgraphs

Béla Bollobás, András Gyárfás, 2008, Discret. Math..

Asymptotic normality of the size of the giant component via a random walk

Béla Bollobás, Oliver Riordan, 2012, J. Comb. Theory, Ser. B.

Graphs with a small number of distinct induced subgraphs

Noga Alon, Béla Bollobás, B. Bollobás, 1989, Discret. Math..

Graphs and Hermitian matrices: Exact interlacing

Béla Bollobás, Vladimir Nikiforov, 2008, Discret. Math..

Clique percolation

Béla Bollobás, Oliver Riordan, 2009, Random Struct. Algorithms.

The Diameter of Random Graphs

Béla Bollobás, B. Bollobás, 1981 .

Sorting and Graphs

Béla Bollobás, Pavol Hell, B. Bollobás, 1985 .

Exact Face-isoperimetric Inequalities

Béla Bollobás, Imre Leader, B. Bollobás, 1990, Eur. J. Comb..

Sequences with Changing Dependencies

Béla Bollobás, Paul N. Balister, Stefanie Gerke, 2008, SIAM J. Discret. Math..

Dimitrios Gunopulos, Béla Bollobás, Heikki Mannila, 1997, SCG '97.

The diameter of random regular graphs

Béla Bollobás, Wenceslas Fernandez de la Vega, B. Bollobás, 1982, Comb..

Hereditary properties of combinatorial structures: Posets and oriented graphs

Béla Bollobás, József Balogh, Robert Morris, 2007, J. Graph Theory.

Parallel Selection with High Probability

Béla Bollobás, Graham R. Brightwell, 1990, SIAM J. Discret. Math..

Random induced graphs

Béla Bollobás, Richard H. Schelp, Paul Erdös, 2002, Discret. Math..

Cycles and semi-topological configurations

Béla Bollobás, B. Bollobás, 1978 .

Sharp thresholds in Bootstrap percolation

Béla Bollobás, József Balogh, 2003 .

Volume Estimates and Rapid Mixing

Béla Bollobás, B. Bollobás, 1997 .

On the structure of edge graphs ii

Miklós Simonovits, Béla Bollobás, Paul Erdös, 1976 .

Erratum to “Parallel machine scheduling with time dependent processing times” [Discrete Appl. Math. 70 (1996) 81–93]

Béla Bollobás, Imre Leader, B. Bollobás, 1997 .

The Height of a Random Partial Order: Concentration of Measure

Béla Bollobás, Graham Brightwell, 1992 .

The Number of k-Sums Modulo k

Béla Bollobás, Imre Leader, 1999 .

Cycles Modulo k

Béla Bollobás, 1977 .

Subgraph Counts and Containment Probabilities of Balanced and Unbalanced Subgraphs in a Large Random Graph a

Béla Bollobás, John C. Wierman, B. Bollobás, 1989 .

Review: László Lovász, Combinatorial problems and exercises

Béla Bollobás, 1981 .

A Tribute to Paul Erdős: The circumference of a graph with a given minimal degree

Béla Bollobás, Roland Häggkvist, 1990 .

Surveys in Combinatorics 2007: Hereditary and monotone properties of combinatorial structures

Béla Bollobás, 2007 .

Judicious partitions of graphs

Béla Bollobás, Alex Scott, B. Bollobás, 1993 .

Combinatorics, geometry, and probability : a tribute to Paul Erdős

Béla Bollobás, Andrew Thomason, Paul Erdős, 1997 .

On matchings and hamiltonian cycles in random graphs Annals of Discrete Mathematics 28

Béla Bollobás, Alan Frieze, B. Bollobás, 1985 .

The typical structure of graphs without given excluded subgraphs

Miklós Simonovits, Béla Bollobás, József Balogh, 2009 .

Judicious partitions of bounded-degree graphs

Béla Bollobás, Alex Scott, 2004 .

THE ASYMPTOTIC NUMBER OF UNLABELLED REGULAR GRAPHS

Béla Bollobás, B. Bollobás, 1982 .

Dependent percolation in two dimensions

Béla Bollobás, Alan Stacey, Paul Balister, 2000 .

Handbook of large-scale random networks

Béla Bollobás, Robert Kozma, B. Bollobás, 2008 .

The maximal size of the covering graph of a lattice

Béla Bollobás, Ivan Rival, 1979 .

On Richardsons model on the hypercube

Yoshiharu Kohayakawa, Béla Bollobás, 1997 .

A Tribute to Paul Erdős: List of contributors

Béla Bollobás, A. Hajnal, A. Baker, 1990 .

Uniquely Colourable Graphs with Large Girth

Béla Bollobás, Norbert Sauer, B. Bollobás, 1976, Canadian Journal of Mathematics.

Oriented Hamilton Cycles in Oriented Graphs

Béla Bollobás, Andrew Thomason, Roland Häggkvist, 1997 .

Random Walks on Graphs

Béla Bollobás, 1998 .

Maximum directed cuts in acyclic digraphs

Noga Alon, Béla Bollobás, András Gyárfás, 2007 .

A Tutte Polynomial for Coloured Graphs

Béla Bollobás, Oliver Riordan, B. Bollobás, 1999, Combinatorics, Probability and Computing.

Random graphs and covering graphs of posets

Béla Bollobás, Jaroslav Nešetřil, Graham Brightwell, 1986 .

On the Structure of Edge Graphs

Béla Bollobás, Paul Erdős, P. Erdos, 1973 .

Spread-out percolation in R d

Béla Bollobás, Svante Janson, Oliver Riordan, 2007 .

Colouring lattices

Béla Bollobás, 1977 .

Large deviations for mean field models of probabilistic cellular automata

Béla Bollobás, Robert Kozma, Paul Balister, 2006 .

An Extension to the Theorem of Bishop and Phelps

Béla Bollobás, B. Bollobás, 1970 .

Random majority percolation

Béla Bollobás, Mark Walters, J. Robert Johnson, 2010 .

Sharp thresholds and percolation in the plane

Béla Bollobás, Oliver Riordan, 2006 .

Linear Analysis: Preface

Béla Bollobás, 1999 .

TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM

Béla Bollobás, József Balogh, Bhargav P. Narayanan, 2015, Forum of Mathematics, Sigma.

The critical probability for random Voronoi percolation in the plane is 1/2

Béla Bollobás, Oliver Riordan, 2006 .

Random Graphs: Models of Random Graphs

Béla Bollobás, 2001 .

Generalized bootstrap percolation

Béla Bollobás, Andrew J. Uzzell, Paul Smith, 2012 .

Counting coloured graphs of high connectivity

Béla Bollobás, 1981 .

On a Conjecture of Erdos, Hajnal and Moon

Béla Bollobás, B. Bollobás, 1967 .

An Abstract Szemerédi Regularity Lemma

Béla Bollobás, Vladimir Nikiforov, B. Bollobás, 2008 .

Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at least k

Béla Bollobás, Colin Cooper, Trevor Fenner, 2000 .

Slow emergence of the giant component in the growing m-out graph

Béla Bollobás, Oliver Riordan, 2005 .

Uniquely Partitionable Graphs

Béla Bollobás, Andrew Thomason, 1977 .

DISJOINT TRIPLES IN A 3-GRAPH WITH GIVEN MAXIMAL DEGREE

Béla Bollobás, 1977 .

Sentry Selection in Wireless Networks

Béla Bollobás, Amites Sarkar, Mark Walters, 2010, Advances in Applied Probability.

Optimal Vertex Partitions

Béla Bollobás, Bennet Manvel, 1979 .

Clique percolation

Béla Bollobás, Oliver Riordan, 2009 .

Bond percolation with attenuation in high dimensional Voronoi tilings

Béla Bollobás, Paul Balister, B. Bollobás, 2010 .

Economical Covers with Geometric Applications

Noga Alon, Béla Bollobás, Van Vu, 2003 .

Girth of sparse graphs

Endre Szemerédi, Béla Bollobás, 2002 .

Connectivity of random addable graphs

Béla Bollobás, Stefanie Gerke, Paul Balister, 2009 .

Shortest paths and load scaling in scale-free trees.

Béla Bollobás, Oliver Riordan, 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

The phase transition in the uniformly grown random graph has infinite order

Béla Bollobás, Svante Janson, Oliver Riordan, 2005 .

On Two Conjectures on Packing of Graphs

Béla Bollobás, Alexandr V. Kostochka, Kittikorn Nakprasit, 2005, Combinatorics, Probability and Computing.

Graph theory and combinatorics, 1988 : proceedings of the Cambridge Combinatorial Conference in honour of Paul Erdős

Béla Bollobás, Paul Erdős, P. Erdos, 1984 .

On complete bipartite subgraphs contained in spanning tree complements

Béla Bollobás, Ronald L. Graham, Fan Chung, 1983 .

LINEAR EXTENSIONS OF A RANDOM PARTIAL ORDER

Noga Alon, Béla Bollobás, Svante Janson, 1994 .

Probabilistic Combinatorics and Its Applications

Béla Bollobás, B. Bollobás, 1992 .

The Art Of Mathematics

Béla Bollobás, 2006 .

Percolation on random Johnson–Mehl tessellations and related models

Béla Bollobás, Oliver Riordan, 2008 .

A Polynomial Invariant of Graphs On Orientable Surfaces

Béla Bollobás, Oliver Riordan, B. Bollobás, 2001 .

An Extremal Problem of Graphs with Diameter 2

Béla Bollobás, Paul Erdös, 1975 .

A Tribute to Paul Erdős: Hamilton cycles in random graphs of minimal degree at least k

Béla Bollobás, Trevor Fenner, Alan Frieze, 1990 .

Subcritical -bootstrap percolation models have non-trivial phase transitions

Béla Bollobás, Paul Balister, B. Bollobás, 2013, 1311.5883.

Point Arboricity Critical Graphs Exist

Béla Bollobás, Frank Harary, 1975 .

Hamiltonian Cycles in Regular Graphs

Béla Bollobás, Arthur M. Hobbs, B. Bollobás, 1978 .

A Tutte Polynomial for Coloured Graphs

Béla Bollobás, Oliver Riordan, 1999 .

Percolation on dual lattices with k-fold symmetry

Béla Bollobás, Oliver Riordan, 2008 .

Weakly Saturated Graphs

Béla Bollobás, B. Bollobás, 1986 .

A polynomial of graphs on surfaces

Béla Bollobás, Oliver Riordan, B. Bollobás, 2002 .

Graphs,Groups and Matrices

Béla Bollobás, B. Bollobás, 1998 .

Alternating Hamiltonian cycles

Béla Bollobás, Paul Erdös, B. Bollobás, 1976 .

The time of bootstrap percolation in two dimensions

Béla Bollobás, Paul Balister, B. Bollobás, 2013, 1305.5444.

The Evolution of the Cube

Béla Bollobás, 1983 .

Random Graphs: Connectivity and Matchings

Béla Bollobás, 2001 .

River landscapes and optimal channel networks

Béla Bollobás, Guido Caldarelli, József Balogh, 2018, Proceedings of the National Academy of Sciences.

Bootstrap percolation on the hypercube

Béla Bollobás, József Balogh, B. Bollobás, 2006 .

An Extension of the Erds-Stone Theorem

Yoshiharu Kohayakawa, Béla Bollobás, 1994 .

The Cut Metric, Random Graphs, and Branching Processes

Béla Bollobás, Svante Janson, Oliver Riordan, 2009, 0901.2091.

The Lion and the Christian, and Other Pursuit and Evasion Games

Béla Bollobás, 2011 .

Colorings generated by monotone properties

Béla Bollobás, Oliver Riordan, 1998 .

Littlewood's Miscellany

Béla Bollobás, B. Bollobás, J. E. Littlewood, 1986 .

Random Graphs: The Degree Sequence

Béla Bollobás, 2001 .

Subcritical $\mathcal{U}$-bootstrap percolation models have non-trivial phase transitions

Béla Bollobás, Paul Balister, B. Bollobás, 2013 .

Linearized chord diagrams and an upper bound for vassiliev invariants

Béla Bollobás, Oliver Riordan, 2000 .

The independence ratio of regular graphs

Béla Bollobás, B. Bollobás, 1981 .

Reverse Kleitman Inequalities

Béla Bollobás, Imre Leader, A. J. Radcliffe, 1989 .

On the girth of Hamiltonian weakly pancyclic graphs

Béla Bollobás, Andrew Thomason, 1997 .

The optimal structure of market areas

Béla Bollobás, Nicholas Stern, 1972 .