Béla Bollobás

Bhargav P. Narayanan

J. Comb. Theory A, 2021

2020

Nucleation and growth in two dimensions.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2020

2019

Dense subgraphs in random graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

2018

Counting dense connected hypergraphs via the probabilistic method.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2018

Line percolation.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2018

Eigenvalues of subgraphs of the cube.

[BibT_eX]

[DOI]

Jonathan Lee

Shoham Letzter

Eur. J. Comb., 2018

Longest common extension.

[BibT_eX]

[DOI]

Shoham Letzter

Eur. J. Comb., 2018

Introduction.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2018

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

[BibT_eX]

[DOI]

Proceedings of the 29th International Conference on Probabilistic, 2018

2017

Exploring hypergraphs with martingales.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2017

Packing random graphs and hypergraphs.

[BibT_eX]

[DOI]

Alex Scott

Random Struct. Algorithms, 2017

Catching a fast robber on the grid.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2017

Jigsaw percolation on random hypergraphs.

[BibT_eX]

[DOI]

J. Appl. Probab., 2017

Sentry selection in sensor networks: theory and algorithms.

[BibT_eX]

[DOI]

Int. J. Sens. Networks, 2017

The Threshold for Jigsaw Percolation on Random Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2017

On the Maximum Running Time in Graph Bootstrap Percolation.

[BibT_eX]

[DOI]

Electron. J. Comb., 2017

2016

Random Hypergraph Irregularity.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

Barrier Coverage.

[BibT_eX]

[DOI]

Amites Sarkar

Random Struct. Algorithms, 2016

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

[BibT_eX]

[DOI]

Bhargav P. Narayanan

Andrei M. Raigorodskii

J. Comb. Theory A, 2016

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

[BibT_eX]

[DOI]

Karen Gunderson

Eur. J. Comb., 2016

Counting Connected Hypergraphs via the Probabilistic Method.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2016

Catching a fast robber on the grid.

[BibT_eX]

[DOI]

CoRR, 2016

2015

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

[BibT_eX]

[DOI]

Paul Smith

Andrew J. Uzzell

Random Struct. Algorithms, 2015

Intersections of hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2015

An old approach to the giant component problem.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2015

Intersections of random hypergraphs and tournaments.

[BibT_eX]

[DOI]

Eur. J. Comb., 2015

Disjoint induced subgraphs of the same order and size.

[BibT_eX]

[DOI]

Teeradej Kittipassorn

Bhargav P. Narayanan

Alexander D. Scott

Eur. J. Comb., 2015

Monotone Cellular Automata in a Random Environment.

[BibT_eX]

[DOI]

Paul Smith

Andrew J. Uzzell

Comb. Probab. Comput., 2015

Partial Shadows of Set Systems.

[BibT_eX]

[DOI]

Tom Eccles

Comb. Probab. Comput., 2015

2014

Interference percolation.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2014

A coding problem for pairs of subsets.

[BibT_eX]

[DOI]

Proceedings of the Geometry, Structure and Randomness in Combinatorics, 2014

2013

Repeated Degrees in Random Uniform Hypergraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

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

[BibT_eX]

[DOI]

Malte Lackmann

Dierk Schleicher

Math. Comput., 2013

Cops and robbers in a random graph.

[BibT_eX]

[DOI]

Gábor Kun

J. Comb. Theory B, 2013

Union-closed families of sets.

[BibT_eX]

[DOI]

Igor Balla

Tom Eccles

J. Comb. Theory A, 2013

Metric Dimension for Random Graphs.

[BibT_eX]

[DOI]

Dieter Mitsche

Pawel Pralat

Electron. J. Comb., 2013

Hereditary and Monotone Properties of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Mathematics of Paul Erdős II, 2013

The Dimension of Random Graph Orders.

[BibT_eX]

[DOI]

Proceedings of the Mathematics of Paul Erdős II, 2013

Paul Erdős: Life and Work.

[BibT_eX]

[DOI]

Proceedings of the Mathematics of Paul Erdős I, 2013

2012

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

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2012

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

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2012

Graph bootstrap percolation.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2012

Walks and paths in trees.

[BibT_eX]

[DOI]

Mykhaylo Tyomkyn

J. Graph Theory, 2012

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

[BibT_eX]

[DOI]

J. Comb. Theory B, 2012

Linear algebra and bootstrap percolation.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2012

Monotone Graph Limits and Quasimonotone Graphs.

[BibT_eX]

[DOI]

Internet Math., 2012

Degree Powers in Graphs: The Erdős-Stone Theorem.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2012

Critical Probabilities of 1-Independent Percolation Models.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2012

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

[BibT_eX]

[DOI]

Electron. J. Comb., 2012

Projections, entropy and sumsets.

[BibT_eX]

[DOI]

Comb., 2012

2011

Sparse graphs: Metrics and random models.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2011

Sparse random graphs with clustering.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2011

On covering by translates of a set.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2011

Intersections of graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2011

Shadows of ordered graphs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2011

The fine structure of octahedron-free graphs.

[BibT_eX]

[DOI]

Miklós Simonovits

J. Comb. Theory B, 2011

The structure of almost all graphs in a hereditary property.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2011

Large joints in graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2011

Daisies and Other Turán Problems.

[BibT_eX]

[DOI]

Claudia Malvenuto

Comb. Probab. Comput., 2011

Multi-path Routing Metrics for Reliable Wireless Mesh Routing Topologies

[BibT_eX]

[DOI]

Phoebus Chen

Karl Henrik Johansson

Shankar Sastry

CoRR, 2011

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

[BibT_eX]

[DOI]

Animashree Anandkumar

Alan S. Willsky

Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

Cover-Decomposition and Polychromatic Numbers.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2011, 2011

Random Graphs, Second Edition

[BibT_eX]

[DOI]

Cambridge Studies in Advanced Mathematics 73, Cambridge University Press, ISBN: 978-0-51181406-8, 2011

2010

Random majority percolation.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2010

Bond percolation with attenuation in high dimensional Voronoi tilings.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2010

The number of graphs with large forbidden subgraphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2010

Max k-cut and judicious k-partitions.

[BibT_eX]

[DOI]

Discret. Math., 2010

Bootstrap Percolation in High Dimensions.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2010

Introduction.

[BibT_eX]

[DOI]

Noga Alon

Comb. Probab. Comput., 2010

2009

Clique percolation.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2009

The typical structure of graphs without given excluded subgraphs.

[BibT_eX]

[DOI]

Miklós Simonovits

Random Struct. Algorithms, 2009

The unlabelled speed of a hereditary graph property.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2009

Highly connected random geometric graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Line-of-Sight Percolation.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2009

Majority Bootstrap Percolation on the Hypercube.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2009

The distribution of the root degree of a random permutation.

[BibT_eX]

[DOI]

Boris G. Pittel

Comb., 2009

2008

Sequences with Changing Dependencies.

[BibT_eX]

[DOI]

Stefanie Gerke

SIAM J. Discret. Math., 2008

Percolation on dual lattices with k-fold symmetry.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2008

Packing d-degenerate graphs.

[BibT_eX]

[DOI]

Alexandr V. Kostochka

Kittikorn Nakprasit

J. Comb. Theory B, 2008

Connectivity of addable graph classes.

[BibT_eX]

[DOI]

Stefanie Gerke

J. Comb. Theory B, 2008

Connectivity of a Gaussian network.

[BibT_eX]

[DOI]

Int. J. Ad Hoc Ubiquitous Comput., 2008

Graphs and Hermitian matrices: Exact interlacing.

[BibT_eX]

[DOI]

Discret. Math., 2008

Joints in graphs.

[BibT_eX]

[DOI]

Discret. Math., 2008

Pentagons vs. triangles.

[BibT_eX]

[DOI]

Ervin Györi

Discret. Math., 2008

Highly connected monochromatic subgraphs.

[BibT_eX]

[DOI]

András Gyárfás

Discret. Math., 2008

2007

Spread-out percolation in Rd.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2007

The phase transition in inhomogeneous random graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2007

Hereditary properties of combinatorial structures: Posets and oriented graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2007

The generalized Randic index of trees.

[BibT_eX]

[DOI]

Stefanie Gerke

J. Graph Theory, 2007

Maximum directed cuts in acyclic digraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2007

Separating systems and oriented graphs of diameter two.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2007

Cliques and the spectral radius.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2007

On separating systems.

[BibT_eX]

[DOI]

Eur. J. Comb., 2007

A note on the Harris-Kesten Theorem.

[BibT_eX]

[DOI]

Eur. J. Comb., 2007

Hereditary Properties of Tournaments.

[BibT_eX]

[DOI]

Electron. J. Comb., 2007

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

[BibT_eX]

[DOI]

Proceedings of the 13th Annual International Conference on Mobile Computing and Networking, 2007

2006

Proving Integrality Gaps without Knowing the Linear Program.

[BibT_eX]

[DOI]

Theory Comput., 2006

Sharp thresholds and percolation in the plane.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2006

Regular subgraphs of random graphs.

[BibT_eX]

[DOI]

Jeong Han Kim

Jacques Verstraëte

Random Struct. Algorithms, 2006

Large deviations for mean field models of probabilistic cellular automata.

[BibT_eX]

[DOI]

Robert Kozma

Random Struct. Algorithms, 2006

How many graphs are unions of k-cliques?

[BibT_eX]

[DOI]

J. Graph Theory, 2006

The Angel and the Devil in three dimensions.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2006

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

[BibT_eX]

[DOI]

Yair Bartal

Manor Mendel

J. Comput. Syst. Sci., 2006

Hereditary properties of partitions, ordered graphs and ordered hypergraphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2006

Pair dominating graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2006

Eliminating Cycles in the Discrete Torus.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

The Art of Mathematics - Coffee Time in Memphis.

[BibT_eX]

[DOI]

Cambridge University Press, ISBN: 978-0-521-69395-0, 2006

Percolation.

[BibT_eX]

Cambridge University Press, ISBN: 978-0-521-87232-4, 2006

2005

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

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2005

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

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2005

Continuum percolation with steps in the square or the disc.

[BibT_eX]

[DOI]

Mark Walters

Random Struct. Algorithms, 2005

Percolation in Voronoi tilings.

[BibT_eX]

[DOI]

Anthony Quas

Random Struct. Algorithms, 2005

A jump to the bell number for hereditary graph properties.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2005

Hereditary properties of words.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2005

Integer sets with prescribed pairwise differences being distinct.

[BibT_eX]

[DOI]

Oleg Pikhurko

Eur. J. Comb., 2005

Books in graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2005

The Sum of Degrees in Cliques.

[BibT_eX]

[DOI]

Electron. J. Comb., 2005

Unavoidable Traces Of Set Systems.

[BibT_eX]

[DOI]

Comb., 2005

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

[BibT_eX]

[DOI]

Biol. Cybern., 2005

2004

Judicious partitions of bounded-degree graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2004

Multicoloured extremal problems.

[BibT_eX]

[DOI]

Peter Keevash

Benny Sudakov

J. Comb. Theory A, 2004

The number of graphs without forbidden subgraphs.

[BibT_eX]

[DOI]

Miklós Simonovits

J. Comb. Theory B, 2004

The interlace polynomial of a graph.

[BibT_eX]

[DOI]

Richard Arratia

Gregory B. Sorkin

J. Comb. Theory B, 2004

Graphs and Hermitian matrices: eigenvalue interlacing.

[BibT_eX]

[DOI]

Discret. Math., 2004

Hermitian matrices and graphs: singular values and discrepancy.

[BibT_eX]

[DOI]

Discret. Math., 2004

Max Cut for Random Graphs with a Planted Partition.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2004

Isoperimetric Problems for r-sets.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2004

How Sharp is the Concentration of the Chromatic Number?

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2004

Degree Powers in Graphs with Forbidden Subgraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2004

The Diameter of a Scale-Free Random Graph.

[BibT_eX]

[DOI]

Comb., 2004

On the Value of a Random Minimum Weight Steiner Tree.

[BibT_eX]

[DOI]

Comb., 2004

A Two-Variable Interlace Polynomial.

[BibT_eX]

[DOI]

Richard Arratia

Gregory B. Sorkin

Comb., 2004

The Phase Transition and Connectedness in Uniformly Grown Random Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Models for the Web-Graph: Third International Workshop, 2004

Fast transmission in ad hoc networks.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

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

[BibT_eX]

[DOI]

Proceedings of the Cellular Automata, 2004

2003

Union of shadows.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

The number of k-SAT functions.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2003

Disjointly representing set systems.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2003

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

[BibT_eX]

[DOI]

J. Comb. Theory B, 2003

Maximum cuts and judicious partitions in graphs without short cycles.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2003

Coupling Scale-Free and Classical Random Graphs.

[BibT_eX]

[DOI]

Internet Math., 2003

Robustness and Vulnerability of Scale-Free Random Graphs.

[BibT_eX]

[DOI]

Internet Math., 2003

Paths of length four.

[BibT_eX]

[DOI]

Amites Sarkar

Discret. Math., 2003

The Oberwolfach Meeting On Combinatorics, Probability And Computing.

[BibT_eX]

[DOI]

Ingo Wegener

Comb. Probab. Comput., 2003

Frank Ramsey.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2003

Special Issue on Ramsey Theory.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2003

Set Systems with few Disjoint Pairs.

[BibT_eX]

[DOI]

Comb., 2003

Sparse distance preservers and additive spanners.

[BibT_eX]

[DOI]

Don Coppersmith

Michael Elkin

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Directed scale-free graphs.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Degree Distribution of the FKP Network Model.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

Analytic Graph Theory.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Graph Theory., 2003

2002

Problems and results on judicious partitions.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2002

Girth of sparse graphs.

[BibT_eX]

[DOI]

Endre Szemerédi

J. Graph Theory, 2002

Evaluations of the Circuit Partition Polynomial.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2002

The Interlace Polynomial of Graphs at - 1.

[BibT_eX]

[DOI]

Eur. J. Comb., 2002

Random induced graphs.

[BibT_eX]

[DOI]

Discret. Math., 2002

Vertex distinguishing colorings of graphs with Delta(G)=2.

[BibT_eX]

[DOI]

Richard H. Schelp

Discret. Math., 2002

Game domination number.

[BibT_eX]

[DOI]

Discret. Math., 2002

Measures on monotone properties of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

Proving Integrality Gaps without Knowing the Linear Program.

[BibT_eX]

[DOI]

Sanjeev Arora

László Lovász

Proceedings of the 43rd Symposium on Foundations of Computer Science, 2002

Modern Graph Theory.

[BibT_eX]

[DOI]

Graduate Texts in Mathematics 184, Springer, ISBN: 978-1-4612-0619-4, 2002

2001

The degree sequence of a scale-free random graph process.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2001

The scaling window of the 2-SAT transition.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2001

Ramsey minimal graphs.

[BibT_eX]

J. Braz. Comput. Soc., 2001

The Penultimate Rate of Growth for Graph Properties.

[BibT_eX]

[DOI]

Eur. J. Comb., 2001

Alternating Knot Diagrams, Euler Circuits and the Interlace Polynomial.

[BibT_eX]

[DOI]

Eur. J. Comb., 2001

A Ramsy-type Theorem for Metric Spaces and its Applications for Metrical Task Systems and Related Problems.

[BibT_eX]

[DOI]

Yair Bartal

Manor Mendel

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

2000

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

[BibT_eX]

[DOI]

J. Graph Theory, 2000

Contraction-Deletion Invariants for Graphs.

[BibT_eX]

[DOI]

Luke Pebody

J. Comb. Theory B, 2000

Local and Mean Ramsey Numbers for Trees.

[BibT_eX]

[DOI]

Alexandr V. Kostochka

Richard H. Schelp

J. Comb. Theory B, 2000

The Speed of Hereditary Properties of Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2000

Judicious Partitions of 3-uniform Hypergraphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2000

A note on generalized chromatic number and generalized girth.

[BibT_eX]

[DOI]

Douglas B. West

Discret. Math., 2000

Polychromatic polynomials.

[BibT_eX]

[DOI]

Discret. Math., 2000

Euler circuits and DNA sequencing by hybridization.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2000

Constrained Graph Processes.

[BibT_eX]

[DOI]

Electron. J. Comb., 2000

The Structure of Hereditary Properties and Colourings of Random Graphs.

[BibT_eX]

[DOI]

Comb., 2000

On a conjecture involving cycle-complete graph Ramsey numbers.

[BibT_eX]

[DOI]

Australas. J Comb., 2000

The interlace polynomial: a new graph polynomial.

[BibT_eX]

[DOI]

Richard Arratia

Gregory B. Sorkin

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999

Counting Boundary Paths for Oriented Percolation Clusters.

[BibT_eX]

[DOI]

Alan Stacey

Random Struct. Algorithms, 1999

Weakly Pancyclic Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1999

Turán's Theorem and Maximal Degrees.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1999

Geometrical Techniques for Estimating Numbers of Linear Extensions.

[BibT_eX]

[DOI]

Alexander F. Sidorenko

Eur. J. Comb., 1999

Closure and Hamiltonian-connectivity of claw-free graphs.

[BibT_eX]

[DOI]

Discret. Math., 1999

Extremal graphs for weights.

[BibT_eX]

[DOI]

Amites Sarkar

Discret. Math., 1999

Exact Bounds for Judicious Partitions of Graphs.

[BibT_eX]

[DOI]

Comb., 1999

1998

Colorings generated by monotone properties.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1998

Paul Erdös and probability theory.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1998

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

[BibT_eX]

[DOI]

Eur. J. Comb., 1998

The oriented cycle game.

[BibT_eX]

[DOI]

Tamás Szabó

Discret. Math., 1998

On some conjectures of Graffiti.

[BibT_eX]

[DOI]

Discret. Math., 1998

Graphs of Extremal Weights.

[BibT_eX]

Ars Comb., 1998

1997

The Structure of Random Graph Orders.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1997

On the girth of hamiltonian weakly pancyclic graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1997

Judicious Partitions of Hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1997

Independent sets and repeated degrees.

[BibT_eX]

[DOI]

Discret. Math., 1997

On a problem of Erdös and Graham.

[BibT_eX]

[DOI]

Norbert Hegyvári

Guoping Jin

Discret. Math., 1997

Matchings and Paths in the Cube.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1997

Random Walks and Electrical Resistances in Products of Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1997

Time-Series Similarity Problems and Well-Separated Geometric Sets.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996

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

[BibT_eX]

[DOI]

J. Comb. Theory B, 1996

On the Best Case of Heapsort.

[BibT_eX]

[DOI]

Trevor I. Fenner

Alan M. Frieze

J. Algorithms, 1996

Sums in the grid.

[BibT_eX]

[DOI]

Discret. Math., 1996

Degree multiplicities and independent sets in K4-free graphs.

[BibT_eX]

[DOI]

Discret. Math., 1996

Turán-Ramsey problems.

[BibT_eX]

[DOI]

Discret. Math., 1996

Highly Linked Graphs.

[BibT_eX]

[DOI]

Comb., 1996

1995

Generalized Chromatic Numbers of Random Graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1995

Connectivity Properties of Random Subgraphs of the Cube.

[BibT_eX]

[DOI]

Tomasz Luczak

Random Struct. Algorithms, 1995

Defect Sauer Results.

[BibT_eX]

A. J. Radcliffe

J. Comb. Theory A, 1995

The maximal number of inducedr-partite subgraphs.

[BibT_eX]

[DOI]

Graphs Comb., 1995

1994

On the Diameter and Radius of Random Subgraphs of the Cube.

[BibT_eX]

[DOI]

Tomasz Luczak

Random Struct. Algorithms, 1994

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

[BibT_eX]

[DOI]

Alan Stacey

Random Struct. Algorithms, 1994

Percolation in High Dimensions.

[BibT_eX]

[DOI]

Eur. J. Comb., 1994

An Extension of the Erdös-Stone Theorem.

[BibT_eX]

[DOI]

Comb., 1994

1993

Probabilistic Analysis of Disjoint Set Union Algorithms.

[BibT_eX]

[DOI]

SIAM J. Comput., 1993

Maximal sets of given diameter in the grid and the torus.

[BibT_eX]

[DOI]

Discret. Math., 1993

Clique coverings of the edges of a random graph.

[BibT_eX]

[DOI]

Comb., 1993

Cycles through specified vertices.

[BibT_eX]

[DOI]

Comb., 1993

1992

The Evaluation of Random Subgraphs of the Cube.

[BibT_eX]

[DOI]

Tomasz Luczak

Random Struct. Algorithms, 1992

A travelling salesman problem in the k-dimensional unit cube.

[BibT_eX]

[DOI]

Amram Meir

Oper. Res. Lett., 1992

1991

Spanning Maximal Planar Subgraphs of Random Graphs.

[BibT_eX]

[DOI]

Alan M. Frieze

Random Struct. Algorithms, 1991

Isoperimetric inequalities and fractional set systems.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1991

Compressions and isoperimetric inequalities.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1991

Graphs without large triangle free subgraphs.

[BibT_eX]

[DOI]

H. R. Hind

Discret. Math., 1991

Edge-isoperimetric inequalities in the grid.

[BibT_eX]

[DOI]

Comb., 1991

An extremal function for the achromatic number.

[BibT_eX]

Bruce A. Reed

Proceedings of the Graph Structure Theory, 1991

1990

The Cost Distribution of Clustering in Random Probing

[BibT_eX]

[DOI]

Andrei Z. Broder

J. ACM, April, 1990

An Isoperimetric Inequality on the Discrete Torus.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1990

Parallel Selection with High Probability.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1990

Complete Matchings in Random Subgraphs on the Cube.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1990

Almost every graph has reconstruction number three.

[BibT_eX]

[DOI]

J. Graph Theory, 1990

Powers of Hamilton cycles in tournaments.

[BibT_eX]

[DOI]

Roland Häggkvist

J. Comb. Theory B, 1990

Isoperimetric Inequalities for Faces of the Cube and the Grid.

[BibT_eX]

[DOI]

A. J. Radcliffe

Eur. J. Comb., 1990

Exact Face-isoperimetric Inequalities.

[BibT_eX]

[DOI]

Eur. J. Comb., 1990

On generalised minimal domination parameters for paths.

[BibT_eX]

[DOI]

Christina M. Mynhardt

Discret. Math., 1990

1989

First cycles in random directed graph processes.

[BibT_eX]

[DOI]

Steen Rasmussen

Discret. Math., 1989

A new upper bound for the list chromatic number.

[BibT_eX]

[DOI]

H. R. Hind

Discret. Math., 1989

Long cycles in graphs with no subgraphs of minimal degree 3.

[BibT_eX]

[DOI]

Discret. Math., 1989

Paul Erdös at seventy-five.

[BibT_eX]

[DOI]

Discret. Math., 1989

Graphs with a small number of distinct induced subgraphs.

[BibT_eX]

[DOI]

Noga Alon

Discret. Math., 1989

1988

The Diameter of a Cycle Plus a Random Matching.

[BibT_eX]

[DOI]

Fan R. K. Chung

SIAM J. Discret. Math., 1988

Transitive Orientations of Graphs.

[BibT_eX]

[DOI]

SIAM J. Comput., 1988

The number of unrelated partitions.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1988

The Isoperimetric Number of Random Regular Graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 1988

Sorting in rounds.

[BibT_eX]

[DOI]

Discret. Math., 1988

The chromatic number of random graphs.

[BibT_eX]

[DOI]

Comb., 1988

1987

Threshold functions.

[BibT_eX]

[DOI]

Comb., 1987

1986

The number of matchings in random regular graphs and bipartite graphs.

[BibT_eX]

[DOI]

Brendan D. McKay

J. Comb. Theory B, 1986

The maximal number of induced complete bipartite graphs.

[BibT_eX]

[DOI]

Chie Nara

Shun-ichi Tachibana

Discret. Math., 1986

Extremal graph theory with emphasis on probabilistic methods.

[BibT_eX]

CBMS-NSF regional conference series in applied mathematics 62, American Mathematical Society, ISBN: 978-0-8218-0712-5, 1986

1985

Regular factors of regular graphs.

[BibT_eX]

[DOI]

Akira Saito

Nicholas C. Wormald

J. Graph Theory, 1985

Repeated Random Insertion into a Priority Queue.

[BibT_eX]

[DOI]

J. Algorithms, 1985

List-colourings of graphs.

[BibT_eX]

[DOI]

Andrew J. Harris

Graphs Comb., 1985

On the Expected Behaviour of Disjoint Set Union Algorithms

[BibT_eX]

[DOI]

Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

An Algorithm for Finding Hamilton Cycles in a Random Graph

[BibT_eX]

[DOI]

Trevor I. Fenner

Alan M. Frieze

Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

1984

Rotation numbers for unions of circuits.

[BibT_eX]

[DOI]

Fang Zu Yao

J. Graph Theory, 1984

The irredundance number and maximum degree of a graph.

[BibT_eX]

[DOI]

Discret. Math., 1984

Diameters of random bipartite graphs.

[BibT_eX]

[DOI]

Victor Klee

Comb., 1984

1983

On 4-cycles in random bipartite tournaments.

[BibT_eX]

[DOI]

Ove Frank

Michal Karonski

J. Graph Theory, 1983

Equitable and proportional coloring of trees.

[BibT_eX]

[DOI]

Richard K. Guy

J. Comb. Theory B, 1983

Almost all Regular Graphs are Hamiltonian.

[BibT_eX]

[DOI]

Eur. J. Comb., 1983

Some remarks on packing trees.

[BibT_eX]

[DOI]

Discret. Math., 1983

Parallel sorting.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1983

1982

More rotation numbers for complete bipartite graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1982

Vertices of given degree in a random graph.

[BibT_eX]

[DOI]

J. Graph Theory, 1982

The diameter of random regular graphs.

[BibT_eX]

[DOI]

Wenceslas Fernandez de la Vega

Comb., 1982

Long paths in sparse random graphs.

[BibT_eX]

[DOI]

Comb., 1982

1981

The size of connected hypergraphs with prescribed covering number.

[BibT_eX]

[DOI]

Carsten Thomassen

J. Comb. Theory B, 1981

Dense neighbourhoods and Turán's theorem.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1981

Indestructive deletions of edges from graphs.

[BibT_eX]

[DOI]

Donald L. Goldsmith

Douglas R. Woodall

J. Comb. Theory B, 1981

Topological cliques of random graphs.

[BibT_eX]

[DOI]

Paul A. Catlin

J. Comb. Theory B, 1981

Graphs which Contain all Small Graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 1981

Degree sequences of random graphs.

[BibT_eX]

[DOI]

Discret. Math., 1981

1980

Hadwiger's Conjecture is True for Almost Every Graph.

[BibT_eX]

[DOI]

Paul A. Catlin

Eur. J. Comb., 1980

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

[BibT_eX]

[DOI]

Eur. J. Comb., 1980

The distribution of the maximum degree of a random graph.

[BibT_eX]

[DOI]

Discret. Math., 1980

1979

Graph-theoretic parameters concerning domination, independence, and irredundance.

[BibT_eX]

[DOI]

J. Graph Theory, 1979

Helly Families of Maximal Size.

[BibT_eX]

[DOI]

Pierre Duchet

J. Comb. Theory A, 1979

Set colourings of graphs.

[BibT_eX]

[DOI]

Discret. Math., 1979

On graphs with equal edge connectivity and minimum degree.

[BibT_eX]

[DOI]

Discret. Math., 1979

1978

Packings of graphs and applications to computational complexity.

[BibT_eX]

[DOI]

Stephen E. Eldridge

J. Comb. Theory B, 1978

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

[BibT_eX]

[DOI]

J. Comb. Theory B, 1978

Uniquely colorable graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1978

Chromatic number, girth and maximal degree.

[BibT_eX]

[DOI]

Discret. Math., 1978

1977

Extremal problems in graph theory.

[BibT_eX]

[DOI]

J. Graph Theory, 1977

Semi-topological subgraphs.

[BibT_eX]

[DOI]

Discret. Math., 1977

1976

On graphs with diameter 2.

[BibT_eX]

[DOI]

Stephen E. Eldridge

J. Comb. Theory B, 1976

On a Ramsey-Turán type problem.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1976

Complete subgraphs are elusive.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1976

1975

On complete subgraphs of r-chromatic graphs.

[BibT_eX]

[DOI]

Endre Szemerédi

Discret. Math., 1975

1974

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

[BibT_eX]

[DOI]

Discret. Math., 1974

1973

Sperner Systems Consisting of Pairs of Complementary Subsets.

[BibT_eX]

[DOI]