Person:168581: Difference between revisions

From MaRDI portal
Person:168581
Created automatically from import230924090903
 
m AuthorDisambiguator moved page Béla Bollobás to Béla Bollobás: Duplicate
 
(No difference)

Latest revision as of 09:53, 8 December 2023

Available identifiers

zbMath Open bollobas.belaWikidataQ834127 ScholiaQ834127MaRDI QIDQ168581

List of research outcomes

PublicationDate of PublicationType
The structure and number of Erdős covering systems2024-03-11Paper
Subcritical monotone cellular automata2024-01-05Paper
A strengthening of Freiman's 3k−4$3k-4$ theorem2023-12-11Paper
Universality for two‐dimensional critical cellular automata2023-09-20Paper
Random Translates in Minkowski Sums2023-08-31Paper
Essential properties of the Tutte polynomial2023-04-28Paper
https://portal.mardi4nfdi.de/entity/Q58813182023-03-09Paper
Erd\H{o}s covering systems2022-11-02Paper
Remarks on a paper of J. Barát and P.P. Varjú2022-10-25Paper
Large sumsets from medium-sized subsets2022-06-19Paper
The Art of Mathematics – Take Two2022-05-02Paper
Large sumsets from small subsets2022-04-15Paper
Universality for monotone cellular automata2022-03-25Paper
The critical length for growing a droplet2022-03-25Paper
On the Erdős covering problem: the density of the uncovered set2022-03-22Paper
The Erdős-Selfridge problem with square-free moduli2021-05-27Paper
Counting independent sets in regular hypergraphs2021-02-22Paper
Erdős covering systems2021-01-25Paper
Flat Littlewood polynomials exist2020-12-14Paper
Covering intervals with arithmetic progressions2020-10-02Paper
Nucleation and growth in two dimensions2020-06-19Paper
River landscapes and optimal channel networks2019-07-03Paper
Dense subgraphs in random graphs2019-05-03Paper
A note on Linnik's theorem on quadratic non-residues2019-03-27Paper
The Erd\H{o}s-Selfridge problem with square-free moduli2019-01-31Paper
Coalescence on the real line2019-01-09Paper
How Ramsey theory can be used to solve Harary's problem for $K_{2,k}$2019-01-06Paper
On the Erd\H{o}s Covering Problem: the density of the uncovered set2018-11-08Paper
Jigsaw percolation on random hypergraphs2018-09-26Paper
Counting dense connected hypergraphs via the probabilistic method2018-09-25Paper
Line percolation2018-09-05Paper
Random geometric graphs and isometries of normed spaces2018-08-15Paper
The sharp threshold for making squares2018-06-19Paper
Eigenvalues of subgraphs of the cube2018-04-25Paper
The sharp threshold for the Duarte model2018-02-14Paper
On a problem of Erdős and Moser2018-01-05Paper
Longest common extension2017-11-14Paper
Monotone Cellular Automata in a Random Environment2017-10-04Paper
Partial Shadows of Set Systems2017-10-04Paper
Counting Connected Hypergraphs via the Probabilistic Method2017-10-04Paper
Packing random graphs and hypergraphs2017-09-26Paper
Catching a fast robber on the grid2017-09-05Paper
Reconstructing random jigsaws2017-07-15Paper
The threshold for jigsaw percolation on random graphs2017-07-13Paper
Exploring hypergraphs with martingales2017-06-02Paper
On the maximum running time in graph bootstrap percolation2017-05-18Paper
A local limit theorem for Quicksort key comparisons via multi-round smoothing2017-01-16Paper
Barrier Coverage2016-11-09Paper
The time of bootstrap percolation in two dimensions2016-10-21Paper
Subtended angles2016-09-15Paper
Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs2016-06-20Paper
Random Hypergraph Irregularity2016-04-04Paper
Subcritical $\mathcal {U}$-bootstrap percolation models have non-trivial phase transitions2016-03-23Paper
On the stability of the Erdős-Ko-Rado theorem2015-11-06Paper
TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM2015-11-02Paper
Der Löwe und der Christ, und andere Verfolgungs- und Fluchtspiele2015-10-29Paper
A coding problem for pairs of subsets2015-10-20Paper
The time of bootstrap percolation with dense initial sets for all thresholds2015-10-12Paper
The Lion and the Christian, and Other Pursuit and Evasion Games2015-06-26Paper
Disjoint induced subgraphs of the same order and size2015-06-18Paper
An old approach to the giant component problem2015-06-10Paper
Consistent random vertex-orderings of graphs2015-06-10Paper
Limited packings of closed neighbourhoods in graphs2015-01-08Paper
Minimal Symmetric Differences of Lines in Projective Planes2014-11-26Paper
Intersections of hypergraphs2014-11-21Paper
Intersections of random hypergraphs and tournaments2014-11-19Paper
The time of bootstrap percolation with dense initial sets2014-08-22Paper
Metric dimension for random graphs2014-08-14Paper
https://portal.mardi4nfdi.de/entity/Q28749122014-08-12Paper
Interference percolation2014-08-07Paper
Address of the Chairman of the Fields Medal Commitee2014-06-03Paper
The Phase Transition in the Erdős-Rényi Random Graph Process2014-05-19Paper
Bootstrap percolation on Galton-Watson trees2014-02-14Paper
Essential enhancements revisited2014-02-04Paper
Repeated Degrees in Random Uniform Hypergraphs2013-06-27Paper
A simple branching process approach to the phase transition in \(G_{n,p}\)2013-06-07Paper
Cops and robbers in a random graph2013-04-17Paper
Turán Densities of Some Hypergraphs Related to $K_{k+1}^{k}$2013-04-09Paper
A small probabilistic universal set of starting points for finding roots of complex polynomials by Newton’s method2013-03-20Paper
Bootstrap Percolation in High Dimensions2013-03-13Paper
Union-closed families of sets2013-03-06Paper
Monotone Graph Limits and Quasimonotone Graphs2013-02-15Paper
Graph bootstrap percolation2012-12-14Paper
Asymptotic normality of the size of the giant component in a random hypergraph2012-12-14Paper
Lion and man -- can both win?2012-11-13Paper
Projections, entropy and sumsets2012-09-17Paper
Linear algebra and bootstrap percolation2012-06-04Paper
Walks and paths in trees2012-06-04Paper
Critical Probabilities of 1-Independent Percolation Models2012-05-14Paper
Degree Powers in Graphs: The Erdős–Stone Theorem2012-05-14Paper
The sharp threshold for bootstrap percolation in all dimensions2012-04-27Paper
Asymptotic normality of the size of the giant component via a random walk2012-03-19Paper
Daisies and Other Turán Problems2011-12-08Paper
Sparse graphs: Metrics and random models2011-08-09Paper
Hamilton cycles in random geometric graphs2011-07-19Paper
https://portal.mardi4nfdi.de/entity/Q30123972011-07-06Paper
https://portal.mardi4nfdi.de/entity/Q30027642011-05-24Paper
Sparse random graphs with clustering2011-05-11Paper
Intersections of graphs2011-04-19Paper
Shadows of ordered graphs2011-04-11Paper
The fine structure of octahedron-free graphs2011-03-14Paper
The structure of almost all graphs in a hereditary property2011-03-14Paper
Percolation on self-dual polygon configurations2011-02-18Paper
On covering by translates of a set2011-01-17Paper
Large joints in graphs2010-11-22Paper
Bond percolation with attenuation in high dimensional VoronoiÌ tilings2010-11-10Paper
Random majority percolation2010-11-10Paper
Clique percolation2010-11-09Paper
The number of graphs with large forbidden subgraphs2010-10-22Paper
Covering numbers for graphs and hypergraphs2010-09-29Paper
The cut metric, random graphs, and branching processes2010-09-16Paper
Max \(k\)-cut and judicious \(k\)-partitions2010-07-07Paper
Sentry Selection in Wireless Networks2010-06-07Paper
Majority Bootstrap Percolation on the Hypercube2010-04-23Paper
Line-of-Sight Percolation2010-04-23Paper
Percolation on dense graph sequences2010-03-08Paper
Erratum to: percolation on random Johnson-Mehl tessellations and related models2010-02-09Paper
Metrics for sparse graphs2010-01-13Paper
Girth of sparse graphs2009-12-08Paper
Bootstrap percolation in three dimensions2009-08-21Paper
Sequences with Changing Dependencies2009-08-20Paper
Random transceiver networks2009-07-22Paper
The typical structure of graphs without given excluded subgraphs2009-06-16Paper
A critical constant for the k nearest-neighbour model2009-05-06Paper
Hereditary properties of tournaments2009-04-07Paper
Highly connected random geometric graphs2009-03-04Paper
An Abstract Szemerédi Regularity Lemma2009-02-12Paper
The unlabelled speed of a hereditary graph property2009-01-21Paper
Eliminating Cycles in the Discrete Torus2008-09-18Paper
Pentagons vs. triangles2008-09-04Paper
Graphs and Hermitian matrices: Exact interlacing2008-09-04Paper
Percolation on dual lattices withk-fold symmetry2008-07-21Paper
Connectivity of addable graph classes2008-04-28Paper
Eliminating cycles in the discrete torus2008-04-23Paper
Percolation on random Johnson-Mehl tessellations and related models2008-04-03Paper
Highly connected monochromatic subgraphs2008-03-13Paper
Spread‐out percolation in d2008-01-08Paper
The generalized Randić index of trees2008-01-04Paper
Hereditary properties of combinatorial structures: Posets and oriented graphs2008-01-04Paper
Joints in graphs2007-12-12Paper
Packing \(d\)-degenerate graphs2007-12-10Paper
Essentially infinite colourings of hypergraphs2007-11-27Paper
https://portal.mardi4nfdi.de/entity/Q54218082007-10-24Paper
Counting regions with bounded surface area2007-10-10Paper
The phase transition in inhomogeneous random graphs2007-09-21Paper
Cliques and the spectral radius2007-08-20Paper
A note on the Harris-Kesten theorem2007-07-27Paper
Degree distribution of the FKP network model2007-07-16Paper
Phase transitions in the neuropercolation model of neural populations with mixed local and non-local interactions2007-06-13Paper
Maximum directed cuts in acyclic digraphs2007-06-11Paper
An Abstract Regularity Lemma2007-04-18Paper
On separating systems2007-04-10Paper
https://portal.mardi4nfdi.de/entity/Q34248822007-03-05Paper
Separating systems and oriented graphs of diameter two2007-02-13Paper
Large deviations for mean field models of probabilistic cellular automata2007-02-07Paper
Sharp thresholds and percolation in the plane2007-02-07Paper
Percolation2006-12-04Paper
Hereditary properties of partitions, ordered graphs and ordered hypergraphs2006-11-15Paper
https://portal.mardi4nfdi.de/entity/Q53936672006-10-24Paper
The critical probability for random Voronoi percolation in the plane is 1/22006-10-16Paper
Regular subgraphs of random graphs2006-09-06Paper
A SHORT PROOF OF THE HARRIS–KESTEN THEOREM2006-08-10Paper
Set colourings of graphs. (Reprint)2006-08-04Paper
Ramsey-type theorems for metric spaces with applications to online problems2006-07-12Paper
https://portal.mardi4nfdi.de/entity/Q54778102006-06-29Paper
Unavoidable traces of set systems2006-06-27Paper
How many graphs are unions of k‐cliques?2006-06-06Paper
Sparse Distance Preservers and Additive Spanners2006-06-01Paper
Pair dominating graphs2006-03-22Paper
Bootstrap percolation on the hypercube2006-03-21Paper
The angel and the devil in three dimensions2006-03-16Paper
The sum of degrees in cliques2006-01-17Paper
On Two Conjectures on Packing of Graphs2005-11-14Paper
A jump to the Bell number for hereditary graph properties2005-09-28Paper
Continuum percolation with steps in the square or the disc2005-08-29Paper
Slow emergence of the giant component in the growing m‐out graph2005-08-29Paper
Algorithms and Models for the Web-Graph2005-08-22Paper
Neuropercolation: A Random Cellular Automata Approach to Spatio-temporal Neurodynamics2005-08-17Paper
A two-variable interlace polynomial2005-07-05Paper
Hereditary properties of words2005-06-07Paper
Percolation in Voronoi tilings2005-06-01Paper
Robustness and Vulnerability of Scale-Free Random Graphs2005-05-09Paper
Integer sets with prescribed pairwise differences being distinct2005-05-04Paper
Connectivity of random k-nearest-neighbour graphs2005-05-03Paper
The phase transition in the uniformly grown random graph has infinite order2005-04-21Paper
Max Cut for Random Graphs with a Planted Partition2005-04-18Paper
Coupling Scale-Free and Classical Random Graphs2005-04-11Paper
Continuum percolation with steps in an annulus2005-03-21Paper
Frank Ramsey2005-03-08Paper
Books in graphs2005-02-23Paper
Graphs and Hermitian matrices: eigenvalue interlacing2005-02-22Paper
The interlace polynomial of a graph2005-02-16Paper
On the value of a random minimum weight Steiner tree2005-02-14Paper
https://portal.mardi4nfdi.de/entity/Q48308052004-12-16Paper
Union of shadows2004-10-27Paper
The diameter of a scale-free random graph2004-10-19Paper
Degree powers in graphs with forbidden subgraphs2004-10-13Paper
Joints in graphs2004-10-07Paper
Multicoloured extremal problems2004-10-01Paper
https://portal.mardi4nfdi.de/entity/Q48192402004-09-24Paper
Set systems with few disjoint pairs2004-09-08Paper
How Sharp is the Concentration of the Chromatic Number?2004-09-07Paper
Hermitian matrices and graphs: Singular values and discrepancy2004-08-19Paper
The number of graphs without forbidden subgraphs2004-08-06Paper
Judicious partitions of bounded‐degree graphs2004-08-04Paper
Directed scale-free graphs2004-07-28Paper
https://portal.mardi4nfdi.de/entity/Q44713242004-07-28Paper
Graphs and Hermitian matrices: discrepancy and singular values2004-04-30Paper
https://portal.mardi4nfdi.de/entity/Q44492152004-02-08Paper
https://portal.mardi4nfdi.de/entity/Q44100052004-01-07Paper
Entropy along convex shapes, random tilings and shifts of finite type2003-11-25Paper
The number of 2-SAT functions2003-11-20Paper
ECONOMICAL COVERS WITH GEOMETRIC APPLICATIONS2003-11-17Paper
Graphs with large maximum degree containing no odd cycles of a given length2003-08-25Paper
Maximum cuts and judicious partitions in graphs without short cycles2003-08-17Paper
Sharp thresholds in bootstrap percolation2003-07-27Paper
https://portal.mardi4nfdi.de/entity/Q45502362003-07-17Paper
Disjointly representing set systems2003-05-27Paper
Paths of length four2003-05-25Paper
The number of k‐SAT functions2003-05-11Paper
Problems and results on judicious partitions2003-03-19Paper
The interlace polynomial of graphs at \(-1\)2003-03-18Paper
Local and mean Ramsey numbers for trees2002-12-10Paper
The speed of hereditary properties of graphs2002-12-10Paper
Contraction-deletion invariants for graphs2002-12-10Paper
Evaluations of the circuit partition polynomial2002-12-10Paper
Game domination number2002-12-02Paper
Euler circuits and DNA sequencing by hybridization2002-11-13Paper
Paths in graphs2002-11-03Paper
https://portal.mardi4nfdi.de/entity/Q45502302002-10-07Paper
Measures on monotone properties of graphs2002-10-01Paper
https://portal.mardi4nfdi.de/entity/Q45502352002-09-17Paper
A polynomial of graphs on surfaces2002-09-17Paper
Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)2002-08-29Paper
https://portal.mardi4nfdi.de/entity/Q45475462002-08-21Paper
Linearized chord diagrams and an upper bound for vassiliev invariants2002-07-30Paper
Random induced graphs2002-05-28Paper
The degree sequence of a scale-free random graph process2002-05-13Paper
The scaling window of the 2-SAT transition2002-02-19Paper
A Polynomial Invariant of Graphs On Orientable Surfaces2002-01-28Paper
https://portal.mardi4nfdi.de/entity/Q27431892001-09-26Paper
Alternating knot diagrams, Euler circuits and the interlace polynomial2001-09-18Paper
The penultimate rate of growth for graph properties2001-09-06Paper
https://portal.mardi4nfdi.de/entity/Q45266252001-06-21Paper
https://portal.mardi4nfdi.de/entity/Q27136522001-06-10Paper
The structure of hereditary properties and colourings of random graphs2001-04-01Paper
Dependent percolation in two dimensions2001-03-20Paper
https://portal.mardi4nfdi.de/entity/Q49526232001-02-13Paper
Essentially Infinite Colourings of Graphs2000-12-13Paper
Polychromatic polynomials2000-11-19Paper
https://portal.mardi4nfdi.de/entity/Q49450532000-11-19Paper
The oriented cycle game2000-11-02Paper
Weakly pancyclic graphs2000-06-25Paper
Convex Bodies, Graphs and Partial Orders2000-06-22Paper
Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at leastk2000-06-21Paper
Exact bounds for judicious partitions of graphs2000-05-14Paper
Geometrical techniques for estimating numbers of linear extensions2000-05-07Paper
Judicious partitions of 3-uniform hypergraphs2000-04-26Paper
Constrainted graph processes2000-04-16Paper
A note on generalized chromatic number and generalized girth2000-03-21Paper
The number of \(k\)-sums modulo \(k\)2000-01-24Paper
Paul Erd?s and probability theory1999-12-19Paper
https://portal.mardi4nfdi.de/entity/Q47053531999-12-19Paper
Closure and Hamiltonian-connectivity of claw-free graphs1999-11-02Paper
Turán's theorem and maximal degrees1999-10-04Paper
To Prove and Conjecture: Paul Erdos and His Mathematics1999-09-23Paper
Extremal graphs for weights1999-09-12Paper
Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs1999-08-10Paper
A Tutte Polynomial for Coloured Graphs1999-05-11Paper
https://portal.mardi4nfdi.de/entity/Q43872271999-04-08Paper
https://portal.mardi4nfdi.de/entity/Q42317811999-03-15Paper
An Erdős-Ko-Rado theorem for signed sets1998-11-17Paper
https://portal.mardi4nfdi.de/entity/Q43933361998-10-28Paper
On a problem of Erdős and Graham1998-09-08Paper
Colorings generated by monotone properties1998-08-31Paper
Hereditary properties of graphs: Asymptotic enumeration, global structure, and colouring1998-08-05Paper
https://portal.mardi4nfdi.de/entity/Q43988641998-07-28Paper
On the girth of hamiltonian weakly pancyclic graphs1998-06-01Paper
On some conjectures of Graffiti1998-05-06Paper
Approximate upper bounds for the critical probability of oriented percolation in two dimensions based on rapidly mixing Markov chains1998-03-31Paper
Independent sets and repeated degrees1998-02-16Paper
Judicious partitions of hypergraphs1998-01-28Paper
https://portal.mardi4nfdi.de/entity/Q43478821998-01-22Paper
Matchings and paths in the cube1997-12-22Paper
https://portal.mardi4nfdi.de/entity/Q43478711997-09-18Paper
https://portal.mardi4nfdi.de/entity/Q43478831997-09-18Paper
https://portal.mardi4nfdi.de/entity/Q48711331997-09-15Paper
Highly linked graphs1997-09-15Paper
https://portal.mardi4nfdi.de/entity/Q43478701997-08-11Paper
Sums in the grid1997-07-07Paper
https://portal.mardi4nfdi.de/entity/Q27855701997-06-26Paper
Random walks and electrical resistances in products of graphs1997-06-16Paper
The Structure of Random Graph Orders1997-05-26Paper
https://portal.mardi4nfdi.de/entity/Q56889991997-03-11Paper
Turán-Ramsey problems1997-03-06Paper
https://portal.mardi4nfdi.de/entity/Q56889981997-03-06Paper
Degree multiplicities and independent sets in \(K_ 4\)-free graphs1996-11-07Paper
A proof of a conjecture of Bondy concerning paths in weighted digraphs1996-10-14Paper
The random-cluster model on the complete graph1996-09-29Paper
https://portal.mardi4nfdi.de/entity/Q48717711996-08-18Paper
https://portal.mardi4nfdi.de/entity/Q48711431996-07-28Paper
On the Best Case of Heapsort1996-06-04Paper
https://portal.mardi4nfdi.de/entity/Q48643081996-05-27Paper
https://portal.mardi4nfdi.de/entity/Q48711321996-05-21Paper
Defect Sauer results1996-03-19Paper
Partition problems in additive number theory1996-03-19Paper
https://portal.mardi4nfdi.de/entity/Q48395161996-03-18Paper
Projections of Bodies and Hereditary Properties of Hypergraphs1996-02-22Paper
Connectivity properties of random subgraphs of the cube1995-11-27Paper
https://portal.mardi4nfdi.de/entity/Q43266331995-08-08Paper
Random high-dimensional orders1995-08-07Paper
On the diameter and radius of randon subgraphs of the cube1995-06-11Paper
The maximal number of induced \(r\)-partite subgraphs1995-05-11Paper
Generalized chromatic numbers of random graphs1995-05-01Paper
Improved upper bounds for the critical probability of oriented percolation in two dimensions1995-02-22Paper
An extension of the Erdős-Stone theorem1995-01-29Paper
Judicious partitions of graphs1994-09-05Paper
https://portal.mardi4nfdi.de/entity/Q42945761994-07-24Paper
Ramsey problems in additive number theory1994-06-13Paper
Probabilistic Analysis of Disjoint Set Union Algorithms1994-06-13Paper
https://portal.mardi4nfdi.de/entity/Q31397451994-05-30Paper
Percolation in high dimensions1994-05-25Paper
https://portal.mardi4nfdi.de/entity/Q42846091994-04-18Paper
Upper bounds for the critical probability of oriented percolation in two dimensions1994-03-14Paper
Maximal sets of given diameter in the grid and the torus1994-03-10Paper
https://portal.mardi4nfdi.de/entity/Q42738421994-01-06Paper
Linear extensions of a random partial order1994-01-01Paper
Connectivity and dynamics for random subgraphs of the directed cube1993-12-07Paper
https://portal.mardi4nfdi.de/entity/Q31418141993-11-09Paper
https://portal.mardi4nfdi.de/entity/Q31358901993-09-21Paper
Cycles through specified vertices1993-09-15Paper
Clique coverings of the edges of a random graph1993-08-16Paper
Graph theory and combinatorics 1988. Proceedings of the Cambridge combinatorial conference (Trinity College, Cambridge, UK, from 21 to 25 March 1988) in honour of Paul Erdős.1993-06-05Paper
The height of a random partial order: Concentration of measure1993-02-22Paper
https://portal.mardi4nfdi.de/entity/Q39952111992-09-17Paper
https://portal.mardi4nfdi.de/entity/Q39962851992-09-17Paper
The Evolution of Random Subgraphs of the Cube1992-06-28Paper
Edge-isoperimetric inequalities in the grid1992-06-27Paper
https://portal.mardi4nfdi.de/entity/Q39750001992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39764031992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39764061992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39766011992-06-26Paper
An Isoperimetric Inequality on the Discrete Torus1992-06-25Paper
On generalised minimal domination parameters for paths1992-06-25Paper
Spanning maximal planar subgraphs of random graphs1992-06-25Paper
Compressions and isoperimetric inequalities1991-01-01Paper
Isoperimetric inequalities and fractional set systems1991-01-01Paper
Box-Spaces and Random Partial Orders1991-01-01Paper
Isoperimetric inequalities for faces of the cube and the grid1990-01-01Paper
Exact face-isoperimetric inequalities1990-01-01Paper
Powers of Hamilton cycles in tournaments1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q52022061990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57539791990-01-01Paper
Parallel Selection with High Probability1990-01-01Paper
The cost distribution of clustering in random probing1990-01-01Paper
Almost every graph has reconstruction number three1990-01-01Paper
Complete matchings in random subgraphs of the cube1990-01-01Paper
An extension of the isoperimetric inequality on the sphere1989-01-01Paper
First cycles in random directed graph processes1989-01-01Paper
Paul Erdős at seventy-five1989-01-01Paper
Long cycles in graphs with no subgraphs of minimal degree 31989-01-01Paper
Graphs with a small number of distinct induced subgraphs1989-01-01Paper
Reverse Kleitman Inequalities1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42079341988-01-01Paper
The number of unrelated partitions1988-01-01Paper
Sorting in rounds1988-01-01Paper
The isoperimetric number of random regular graphs1988-01-01Paper
The chromatic number of random graphs1988-01-01Paper
The Longest Chain Among Random Points in Euclidean Space1988-01-01Paper
The Diameter of a Cycle Plus a Random Matching1988-01-01Paper
Transitive Orientations of Graphs1988-01-01Paper
Graphs whose every transitive orientation contains almost every relation1987-01-01Paper
An algorithm for finding Hamilton paths and cycles in random graphs1987-01-01Paper
Threshold functions1987-01-01Paper
Random graphs and covering graphs of posets1986-01-01Paper
The number of matchings in random regular graphs and bipartite graphs1986-01-01Paper
The maximal number of induced complete bipartite graphs1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37261251986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37289341986-01-01Paper
List-colourings of graphs1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36825181985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37025241985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37151481985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37206441985-01-01Paper
Repeated random insertion into a priority queue1985-01-01Paper
Regular factors of regular graphs1985-01-01Paper
Diameters of random bipartite graphs1984-01-01Paper
The irredundance number and maximum degree of a graph1984-01-01Paper
Inequalities for quadratic polynomials in Hermitian and dissipative operators1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51849381984-01-01Paper
Rotation numbers for unions of circuits1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33440241984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33479281984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36916981984-01-01Paper
The Evolution of Random Graphs1984-01-01Paper
On Helly families of maximal size1983-01-01Paper
Almost all regular graphs are Hamiltonian1983-01-01Paper
Equitable and proportional coloring of trees1983-01-01Paper
Parallel sorting1983-01-01Paper
Some remarks on packing trees1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32181561983-01-01Paper
On 4‐cycles in random bipartite tournaments1983-01-01Paper
The Evolution of the Cube1983-01-01Paper
The Asymptotic Number of Unlabelled Regular Graphs1982-01-01Paper
Long paths in sparse random graphs1982-01-01Paper
The diameter of random regular graphs1982-01-01Paper
The Trail Number of a Graph1982-01-01Paper
Distinguishing Vertices of Random Graphs1982-01-01Paper
More rotation numbers for complete bipartite graphs1982-01-01Paper
Vertices of given degree in a random graph1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47399351981-01-01Paper
Topological cliques of random graphs1981-01-01Paper
Degree sequences of random graphs1981-01-01Paper
Sorting in one round1981-01-01Paper
Graphs which contain all small graphs1981-01-01Paper
The size of connected hypergraphs with prescribed covering number1981-01-01Paper
Dense neighbourhoods and Turan's theorem1981-01-01Paper
The Independence Ratio of Regular Graphs1981-01-01Paper
Threshold functions for small subgraphs1981-01-01Paper
The Diameter of Random Graphs1981-01-01Paper
Counting Coloured Graphs of High Connectivity1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39505881981-01-01Paper
The distribution of the maximum degree of a random graph1980-01-01Paper
A probabilistic proof of an asymptotic formula for the number of labelled regular graphs1980-01-01Paper
Hadwiger's conjecture is true for almost every graph1980-01-01Paper
Martingale inequalities1980-01-01Paper
Measure Graphs1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41987851979-01-01Paper
On graphs with equal edge connectivity and minimum degree1979-01-01Paper
The maximal size of the covering graph of a lattice1979-01-01Paper
Set colourings of graphs1979-01-01Paper
Helly families of maximal size1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30504571979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32052801979-01-01Paper
Graph-theoretic parameters concerning domination, independence, and irredundance1979-01-01Paper
Optimal Vertex Partitions1979-01-01Paper
Hamiltonian Cycles in Regular Graphs1978-01-01Paper
Extremal Graphs without Large Forbidden Subgraphs1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41594061978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41827861978-01-01Paper
Cycles and semi-topological configurations1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42002531978-01-01Paper
Packings of graphs and applications to computational complexity1978-01-01Paper
Uniquely colorable graphs1978-01-01Paper
Chromatic number, girth and maximal degree1978-01-01Paper
The number of 1-factors in 2k-connected graphs1978-01-01Paper
Semi-topological subgraphs1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38522121978-01-01Paper
Cycles Modulo k1977-01-01Paper
DISJOINT TRIPLES IN A 3-GRAPH WITH GIVEN MAXIMAL DEGREE1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41412781977-01-01Paper
Extremal problems in graph theory1977-01-01Paper
Uniquely Partitionable Graphs1977-01-01Paper
Colouring lattices1977-01-01Paper
On the Structure of Edge Graphs II1976-01-01Paper
On complete subgraphs of different orders1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40888531976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40973261976-01-01Paper
SETS OF INDEPENDENT EDGES OF A HYPERGRAPH1976-01-01Paper
Uniquely Colourable Graphs with Large Girth1976-01-01Paper
Cliques in random graphs1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41119511976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41138621976-01-01Paper
Maximal matchings in graphs with given minimal and maximal degrees1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41294771976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41765791976-01-01Paper
Complete subgraphs are elusive1976-01-01Paper
On graphs with diameter 21976-01-01Paper
Alternating Hamiltonian cycles1976-01-01Paper
On a Ramsey-Turán type problem1976-01-01Paper
Representation of systems of measurable sets1975-01-01Paper
Point Arboricity Critical Graphs Exist1975-01-01Paper
An Extremal Problem of Graphs with Diameter 21975-01-01Paper
The numerical ranges of unbounded linear operators1975-01-01Paper
On complete subgraphs of \(r\)-chromatic graphs1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41001171974-01-01Paper
Normally subregular systems in normed algebras1974-01-01Paper
The Spatial Numerical Range and Powers of an Operator1974-01-01Paper
Best possible bounds of the norms of inverses adjoined to normed algebras1974-01-01Paper
Three-graphs without two triples whose symmetric difference is contained in a third1974-01-01Paper
On the Structure of Edge Graphs1973-01-01Paper
The Optimal Arrangement of Producers1973-01-01Paper
A Theorem in Transversal Theory1973-01-01Paper
Sperner systems consisting of pairs of complementary subsets1973-01-01Paper
Adjoining Inverses to Commutative Banach Algebras1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51827101973-01-01Paper
The Spectral Decomposition of Compact Hermitian Operators on Banach Spaces1973-01-01Paper
Functionals close to each other1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56194231971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56281651971-01-01Paper
The Numerical Range in Banach Algebras and Complex Functions of Exponential type1971-01-01Paper
A Property of Hermitian Elements1971-01-01Paper
The Maximal Number of Triangles of Maximal Perimeter Length Determined by a Finite Set1970-01-01Paper
An Extension to the Theorem of Bishop and Phelps1970-01-01Paper
\(k\)-tuples of the first \(n\) natural numbers1969-01-01Paper
A lower bound for the number of non-isomorphic matroids1969-01-01Paper
Area of the union of disks1968-01-01Paper
A problem of the theory of communication networks1968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55458461968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55541041968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55589321968-01-01Paper
On a Conjecture of Erdos, Hajnal and Moon1967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55387181967-01-01Paper
An Extremal Problem for Polygons Inscribed in a Convex Curve1967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55520971967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55205651966-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55291461966-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55432251966-01-01Paper
On generalized graphs1965-01-01Paper
https://portal.mardi4nfdi.de/entity/Q53378031964-01-01Paper
https://portal.mardi4nfdi.de/entity/Q53311161963-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57281321962-01-01Paper
Joints in graphs0001-01-03Paper
Erd\H{o}s covering systems0001-01-03Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Béla Bollobás