Name: BELA BOLLOBAS | Department:MATHEMATICAL SCIENCES |

DEGREES | DISCIPLINE | INSTITUTION | YEAR |
---|---|---|---|

Diploma in Mathematics | Mathematics | Budapest | 1966 |

Dr. Rer. Nat. | Mathematics | Budapest | 1967 |

Ph.D. | Mathematics | University of Cambridge, England | 1972 |

Sc.D. | Mathematics | University of Cambridge, England | 1984 |

RANK/POSITION | DEPARTMENT/DIVISION | INSTITUTION/COMPANY/ORGANIZATION | PERIOD |
---|---|---|---|

Research Fellow | Mathematical Institute | Hungarian Academy of Sciences, Budapest | 1966-70 |

Exchange Scientist | Soviet Academy of Sciences, Moscow | 1967-68 | |

Postdoctoral Fellow | Mathematical Institute | University of Oxford | 1970 |

Research Fellow | Trinity College | University of Cambridge, England | 1970-72 |

Assistant Lecturer | Mathematics | University of Cambridge, England | 1971-73 |

Teaching Fellow | Trinity College | University of Cambridge, England | 1972- |

Lecturer | Mathematics | University of Cambridge, England | 1973-1985 |

Reader | Pure Mathematics | University of Cambridge, England | 1985-96 |

Professor | Mathematics | Louisiana State University | 1982-94 |

Chair of Excellence | Combinatorics | University of Memphis | 1995- |

HONOR/AWARD | INSTITUTION/COMPANY/ORGANIZATION | YEAR |
---|---|---|

Foreign Member | Hungarian Academy of Sciences | 1990 |

Senior Whitehead Prize | London Mathematical Society | 2007 |

Fellow of the Royal Society | The Royal Society | 2011 |

Inaugural Fellow of the American Mathematical Society | American Mathematical Society | 2013 |

Foreign Member | Polish Academy of Sciences | 2013 |

Honorary Doctorate | Adam Mickiewicz University | 2013 |

Bocskai Prize | Budapest, Hungary | 2016 |

Szechenyi Prize | The Hungarian State Dept. | 2017 |

Member | Academay of Europea | 2017 |

SUBJECT | INSTITUTION |
---|---|

Functional Analysis (U); Complex Variables (U); | University of Cambridge, England |

Real Analysis (U); Rings, Fields and Modules (U); Graph Theory (U) | |

Group Theory (U); Representation Theory (U); | |

Geometry of Banach Spaces (G); Ergodic Theory (G); | |

Extremal Graph Theory (G); Probabilistic Combinatorics (G); | |

Random Graphs (G); Concentration of Measure Phenomena (G) Random Graph Theory I and II (G) Polynonomials of Knots (G) Polynomials of Graphs and Knots (G) |

CURRENT DEGREE | NAME | YEAR OF GRADUATION |
---|---|---|

Doctoral | Tamas Szabo | 1998 |

Doctoral | David Weinreich | 2000 |

Doctoral | Joszef Balogh | 2001 |

Doctoral | Luke Pebody | 2002 |

Doctoral | Jonathan Cutler | 2004 |

Doctoral | Alice Hubenko | 2004 |

Doctoral | Balazs Montagh | 2005 |

Doctoral | Henry Liu | 2006 |

Doctoral | Robert Morris | 2006 |

Doctoral | Fabricio Benevides | 2011 |

Doctoral | Karen Johannson-Gunderson | 2011 |

Doctoral | Neal Bushaw | 2012 |

Doctoral | Andrew Uzzell | 2012 |

Doctoral | Ago-Erik Riet | 2012 |

Doctoral | Dominik Vu | 2014 |

Doctoral | Tomas Juskevicius | 2015 |

Doctoral | Teeradej Kittipassorn | 2015 |

Doctoral | Richard Johnson | 2015 |

Doctoral | Julian Sahasrabudhe | 2017 |

Doctoral | Scott Binski | 2017 |

Doctoral | Kamil Krzesimir Popielarz | 2018 (anticipated) |

Doctoral | Richard Snyder | 2018 (anticipated) |

Doctoral | David C Lewis | 2019 (anticipated) |

Doctoral | Stephen G Smith | 2019 (anticipated) |

Doctoral | Rebekah Herrman | 2020 (anticipated) |

*Percolation*, Cambridge University Press, Cambridge, 2006. (ix+334pp.) (with O.M. Riordan)

*The Art of Mathematics–Coffee Time in Memphis*, Springer-Verlag, 2006. (x+376pp.)

*Extremal Graph Theory*. Reprint of the 1978 original. Dover Publications, Inc.: Mineola, NY, 2004. (xx+488pp.)

*Random Graphs,* 2nd edition. Cambridge University Press, Cambridge, 2001.(xviii+498pp.)

*Linear Analysis: An Introductory Course*, 2nd edition. Cambridge University Press, Cambridge, 1999. (xi+240)

*Modern Graph Theory, Graduate Texts in Mathematics*, Springer-Verlag, New York-Heidelberg-Berlin, 1998. (x+394pp.)

*Linear Analysis—An Introductory Course*, Cambridge University Press, 1990. (xi+240pp.)

*Extremal Graph Theory with Emphasis on Probabilistic Methods, CBMS Reg. Ser. in Math*., Vol. **62**,* Amer. Math. Soc*., Rhode Island, 1986. (vii+64pp.)

*Random Graphs*, Academic Press, London, 1985. (xvi+447pp.)

*Graph Theory—An Introductory Course, Graduate Texts in Mathematics*, Springer-Verlag, New York-Heidelberg-Berlin, 1979. (x+180 pp.)

*Extremal Graph Theory*, *London Mathematical Society Monographs 11*, Academic Press, London-New York-San Francisco, 1978. (xx+488pp.)

*Combinatorics—Set Systems, Hypergraphs, Families of Vectors, and Combinatorial Probability*, Cambridge University Press, Cambridge 1986. (xii+177pp.)

**Volumes Edited**

Advances in Graph Theory, Annals of Discrete Math. 3, North-Holland, Amsterdam-New York-Oxford, 1978. (vii+295pp.)

*Combinatorics, Probability and Computing.* Papers from the meeting held in Oberwolfach, 23-29 Sept 2001, Cambridge University Press, Cambridge, 2002.

*Contemporary Combinatorics, Bolyai Society Mathematical Studies, 10*, Springer-Verlag, New York-Heidelberg-Berlin, 2002. (301pp.)

*Surveys in Combinatorics*, Proceedings of the 7th British Combinatorial Conference, London Math. Soc. Lecture Note Series, 38, Cambridge University Press, Cambridge-London-New York-Melbourne, 1979. (vii+261pp.)

*Graph Theory, Annals of Discr. Math*. **13**, North-Holland, Amsterdam-New York-Oxford, 1982. (viii+201pp.)

*Graph Theory and Combinatorics: Proceedings of the Cambridge Conference in Honor of Paul Erdos*, Academic Press, London, 1984. (xvii+328pp.)

*Littlewood’s Miscellany,* Cambridge University Press, 1986. (iv+200pp.)

*Graph Theory and Combinatorics 1988*, Annals of Discr. Math. **43**, North-Holland, Amsterdam-New York-Oxford-Tokyo, 1989. (viii+410pp.)

A Tribute to Paul Erd˝os, Cambridge University Press, 1990. (xv+478pp.) (with A. Baker and A. Hajnal)

*Probabilistic Combinatorics and Its Applications,* by F. Chung (Proceedings of Symposia in Applied Mathematics), American Mathematical Society, 2002, pp 212.

*Combinatorics, Geometry and Probability*, Cambridge University Press, 1997. (xxii+562pp) (with A. Thomason)

*Flavors of Geometry*, Math. Sci. Res. Inst. Publ. 31, Cambridge Univ. Press, Cambridge, 1997.

*Practical Foundations of Mathematics*. Cambridge University Press,1999. (with P. Taylor)

*Modular Forms and Galois Cohomology* Cambridge University Press, June 2000, pp. 356. (with H. Hida and W. Fulton)

*Enumerative Combinatoric*s, Cambridge Studies in Advanced Mathematics.Volume 1, Cambridge University Press, Feb. 2000, pp. 340.(with R. Stanley and W. Fulton)

Contemporary Combinatorics, Bolyai Soc. Math. Studies **10**, Budapest, 2002.

*Algebraic Automata Theory* Cambridge University Press, June 2004, pp.244. (with M. Holcombe and W. M. L. Holcombe)

*Handbook of Large-Scale Random Networks* (Bolyai Society Mathematical Studies).Springer, August 2009, pp. 600. (with R. Kozma and D. Miklos)

Exploring hypergraphs with martingales. *Random Structures Algorithms* **50** (2017), no. 3, 325–352. (with O. Riordan) **
**

On the maximum running time in graph bootstrap percolation. *Electron. J. Combin.* **24** (2017), no. 2,Paper 2.16, 20 pp. (with M. Przykucki, O. Riordan and J. Sahasrabudhe)

The threshold for jigsaw percolation on random graphs. *Electron. J. Combin.* **24** (2017), no. 2, Paper 2.36, 14 pp. (with O. Riordan, E. Slivken and P. Smith)

Packing random graphs and hypergraphs.*Random Structures Algorithms* **51** (2017), no. 1, 3–13. (with S. Janson and A. Scott) **
**

Catching a fast robber on the grid. *J. Combin. Theory Ser. A* **152 **(2017), 341–352. (P. Balister, A. Shaw and B. Narayanan)**
**

On a problem of Erdos and Moser. *Abh. Math. Semin. Univ. Hambg.* 87 (2017), no. 2, 213–222. (with A. Scott) **
**

On the stability of the Erdos-Ko-Rado theorem. *J. Combin. Theory Ser. A* **137** (2016), 64–78. (with B. Narayanan and A. Raigorodskii) **
**

Counting connected hypergraphs via the probabilistic method. *Combin. Probab. Comput.* **25** (2016), no. 1,21–75. (with O. Riordan) **
**

Subcritical U-bootstrap percolation models have non-trivial phase transitions.*Trans. Amer. Math. Soc.* **368** (2016), no. 10, 7385–7411. (with M. Przykucki and P. Smith)**
**

Random hypergraph irregularity. *SIAM J. Discrete Math.* **30** (2016), no. 1,465–473. (with P. Balister, J. Lehel and M. Morayne)**
**

Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs. *European J. Combin.* **57** (2016), 85–93. (with P. Balister and K. Gunderson)**
**

Subtended angles. *Israel J. Math.*** ****214** (2016), no. 2,995–1012. (with Z. Furedi, I. Leader and M. Walters) **
**

Barrier coverage. *Random Structures Algorithms* **49** (2016), no. 3, 429–478. (with P. Balister and A. Sarkar)**
**

The time of bootstrap percolation in two dimensions. *Probab. Theory Related Fields* **166** (2016), no. 1-2, 321–364. (with P. Balister and P. Smith)**
**

Intersections of random hypergraphs and tournaments. *European J. Combin.* **44** (2015), part A,125–139. (with A. Scott)**
**

Intersections of hypergraphs. *J. Combin. Theory Ser. B* **110** (2015), 180–208. (with A. Scott)**
**

An old approach to the giant component problem. *J. Combin. Theory Ser. B* **113** (2015), 236–260. (with O. Riordan)**
**

Disjoint induced subgraphs of the same order and size. *European J. Combin.* **49 **(2015), 153–166. (with T. Kittipassorn, B. Narayanan and A. Scott)**
**

Monotone cellular automata in a random environment. *Combin. Probab. Comput.* **24**(2015), no. 4, 687–722. (with P. Smith and A. Uzzell)**
**

A coding problem for pairs of subsets. *Geometry, structure and randomness in combinatorics, *47–59, CRM Series, **18**, *Ed. Norm., Pisa,* 2015. (with Z. Furedi, I. Kantor, G. Katona, and I. Leader)

The time of bootstrap percolation with dense initial sets for all thresholds. *Random Structures Algorithms* **47** (2015), no. 1, 1–29. (with P. Smith and A. Uzzell) **
**

Partial shadows of set systems. *Combin. Probab. Comput.* **24** (2015), no. 5, 825–828. (with T. Eccles)**
**

Transference for the Erdos-Ko-Rado theorem. *Forum Math. Sigma*** ****3** (2015), e23, 18 pp. (with J. Balogh, and B. Narayanan)

Bootstrap percolation on Galton-Watson trees.*Electron. J. Probab.* 19 (2014), no. 13, 27 pp. (with K. Gunderson, C. Holmgren, S. Janson and M. Przykucki)

Interference percolation. *Random Structures Algorithms* **44** (2014), no. 4, 399–418. (with P.Balister)**
**

Random union-closed families. *Number theory, analysis, and combinatorics, *1–9, De Gruyter Proc. Math., *De Gruyter, Berlin,* 2014. (with Paul Balister)

Minimal symmetric differences of lines in projective planes. *J. Combin. Des.* **22** (2014), no. 10, 435–451. (with P. Balister, Z. Furedi and J. Thompson) **
**

The time of bootstrap percolation with dense initial sets. *Ann. Probab.* 42 (2014), no. 4, 1337–1373. (with C. Holmgren, P. Smith and A. Uzzell)**
**

A small probabilistic universal set of starting points for finding roots of complex polynomials by Newton's method. *Math. Comp.* 82(2013), no. 281, 443–457. (with M. Lackmann and D. Schleicher)**
**

The phase transition in random graphs. *Topics in structural graph theory, *219–250, Encyclopedia Math. Appl., 147, *Cambridge Univ. Press, Cambridge,* 2013. (with O. Riordan)

Metric dimension for random graphs.*Electron. J. Combin.* 20 (2013), no. 4, Paper 1, 19 pp. (with D. Mitsche and P. Pralat)

The phase transition in the Erdos-Rényi random graph process. *Erdös centennial, *59–110, Bolyai Soc. Math. Stud., 25, *János Bolyai Math. Soc., Budapest,* 2013. (with O. Riordan)

Union-closed families of sets.* J. Combin. Theory Ser. A* **120 **(2013), no. 3, pp.531-544. (with I. Balla and T. Eccles)

Repeated degrees in random uniform hypergraphs.* SIAM J. Discrete Math*.** 27** (2013), no. 1, pp.145-154. (with P. Paul, J. Lehel and M. Morayne)

Cover-decomposition and polychromatic numbers. *SIAM J. Discrete Math*. **27** (2013), no. 1, pp. 240-256. (D. Pritchard, T. Rothvoss and A. Scott)

Cops and robbers in a random graph. *J. Combin. Theory Ser. B* **103** (2013), no. 2, pp.226-236. (with G. Kun and I. Leader)

Walks and paths in trees. *J. Graph Theory ***70** (2012), no. 1, pp.54- 66.(with M. Tyomkyn)

Turan densities of some hypergraphs related to Kkk+1. *SIAM J. Discrete Math*. **26** (2012), no. 4, 16091617. (with J. Balogh; T. Bohman; and Y. Zhao)

The sharp threshold for bootstrap percolation in all dimensions. *Trans. Amer. Math. Soc.* **364** (2012), no. 5, pp. 2667-2701. (with J. Balogh, H. Duminil-Copin and R. Morris)

Projections, entropy and sumsets. *Combinatorica ***32** (2012), no. 2, pp.125-141.(with P. Balister)

Monotone graph limits and quasimonotone graphs. *Internet Math*. **8** (2012), no. 3, pp.187-231.(with S. Janson and O. Riordan)

Lion and mancan both win? *Israel J. Math.* **189** (2012), pp.267-286. (with I. Leader and M. Walters).

Linear algebra and bootstrap percolation. J*. Combin. Theory Ser. A*** 119 **(2012), no. 6, pp. 1328-1335. (with J. Balogh, R. Morris and O. Riordan)

Graph bootstrap percolation.* Random Structures Algorithms* **41** (2012), no. 4, 413440.(with J. Balogh and R. Morris)

Degree powers in graphs: the Erdos-Stone theorem. *Combin. Probab. Comput*.** 21** (2012), no. 1-2, pp.89-105. (with V. Nikiforov)

Critical probabilities of 1-independent percolation models. *Combin. Probab. Comput.* **21** (2012), no. 1-2, pp.11-22. (with P. Balister)

Asymptotic normality of the size of the giant component via a random walk. *J. Combin. Theory Ser. B* **102** (2012), no. 1, pp.53-61. (with O. Riordan)

Asymptotic normality of the size of the giant component in a random hypergraph. *Random Structures Algorithms* **41** (2012), no. 4, pp. 441- 450. (with O. Riordan)

A simple branching process approach to the phase transition in G_{n,p}. *Electron. J. Combin*. **19** (2012), no. 4, Paper 21, 8 pp. (with O.Riordan)

The structure of almost all graphs in a hereditary property.* J. Combin. Theory Ser. B* **101** (2011), 85-110. (with N. Alon, J. Balogh, and R. Morris)

The fine structure of octahedron-free graphs. *J. Combin. Theory Ser. B* **101** (2011), 67-84. (with J. Balogh and M. Simonovits)

Sparse random graphs with clustering. *Random Structures Algorithms.* **38** (2011), 269-323. (with S. Janson and O. Riordan)

Sparse graphs: metrics and random models. *Random Structures Algorithms* **39** (2011), 1-38. (with O. Riordan)

Shadows of ordered graphs. *J. Combin. Theory Ser. A* **118** (2011), 729-747. (with G. Brightwell and R. Morris)

On covering by translates of a set. *Random Structures Algorithms* **38** (2011), 33-67. (with J. Balogh and O. Riordan)

Large joints in graphs. *European J. Combin*. **32** (2011), 33-44. (with V. Nikiforov)

Intersections of graphs.* J. Graph Theory* **66** (2011), 261-282. (with A. Scott)

Hamilton cycles in random geometric graphs. *Ann. Appl. Probab*. **21** (2011), 1053-1072. (with J. Balogh, M. Krivelevich, T. M¨uller and M. Walters)

Daisies and other Turan problems.* Combin. Probab. Comput.* **20** (2011), no. 5, pp. 743-747. (with I. Leader and C. Malvenuto)

Cover-decomposition and polychromatic numbers. *Algorithms ESA 2011*, pp799-810, *Lecture Notes in Comput. Sci.*, **6942**, Springer, Heidelberg, 2011, (with D. Pritchard, T. Rothvoss and A. Scott).

The number of graphs with large forbidden subgraphs. *European Journal of Combinatorics* **31**, (2010), 1964–1968. (with V. Nikiforov)

The cut matric, random graphs, and branching processes. *J. Statistical Physics* **140**, (2010), 289–335. (with S. Janson and O. Riordan)

Random majority percolation. *Random Structures Algorithms* **36**, (2010), 315–340.(with P. Balister, R. Johnson, and M. Walters)

Sentry selection in wireless networks. *Adv. in Appl. Probab*. **42**, (2010), 1–25. (with P. Balister, Paul, A. Sarkar, and M. Walters)

Percolation on dense graph sequences. *Ann. Probab*. **38** (2010), 150– 183.(with C. Borgs, J. Chayes, and O. Riordan)

Max k-cut and judicious k-partitions. *Discrete Math*. **310, **(2010), 2126–2139. (with A. Scott)

Connectivity of random addable graphs.* Advances in discrete mathematics and applications*: Mysore, 2008, 125-132, *Ramanujan Math. Soc. Lect. Notes Ser*., **13,** Ramanujan Math. Soc., Mysore, 2010. (with P. Balister and S. Gerke)

Bond percolation with attenuation in high dimensional Voronoi tilings. *Random Structures Algorithms* **36**, (2010), 5–10. (with P. Balister)

Bootstrap percolation in high dimensions.* Combinatorics, Probability and Computing ***19**, (2010), 643–692. (with J. Balogh and R. Morris)

The unlabeled speed of a hereditary graph property.* J. Combin. Theory Ser. B* **99** (2009), 9–19. (with J. Balogh, J. Saks, and V. Sos)

The typical structure of graphs without given excluded subgraphs. *Random Structures Algorithms* **34** (2009), 305–318.(with J. Balogh and M. Simonovits)

The distribution of the root degree of a random permutation.* Combinatorica* **29 **(2009), 131–151.(with B. Pittel)

Random transceiver networks. *Adv. in Appl. Probab*. **41** (2009), 323–343.(with P. Balister and M. Walters)

Random graphs and branching processes. *Handbook of large-scale random networks,* 15–115,* Bolyai Soc. Math. Stud.*, **18**, Springer, Berlin, 2009. (with O. Riordan)

Percolation, connectivity, coverage and colouring of random geometric graphs. *Handbook of large-scale random networks, *117–142, *Bolyai Soc. Math. Stud.*, **18**, Springer, Berlin, 2009. (with A. Sarkar and P. Balister)

Metrics for sparse graphs. Surveys in combinatorics 2009, 211–287, *London Math. Soc. Lecture Note Ser.,* **365**, Cambridge Univ. Press, Cambridge, 2009. (with O. Riordan)

Majority bootstrap percolation on the hypercube.* Combin. Probab. Comput.* **18** (2009), 17–51. (with J. Balogh)

Line-of-sight percolation. *Combin. Probab. Comput*. **18** (2009), 83– 106. (with S. Janson and O. Riordan)

Highly connected random geometric graphs. *Discrete Applications of Math*. **157** (2009), 309–320. (with P. Balister, A. Sarkar and M. Walters)

*Clique percolation. Random Structures Algorithm*s **35** (2009), 294–322. (with O. Riordan)

Bootstrap percolation in three dimensions.* Ann. Probab*. **37** (2009), 1329–1380. (with R. Morris)

A critical constant for the k-nearest-neighbour model. *Adv. in Appl. Probab. ***41** (2009), 1–12.(with P. Balister, A. Sarkar, and M. Walters)

Sequences with changing dependencies, *SIAM J. Discrete Math*. **22** (2008), 1149–1154. (with P. Balister and S. Gerke)

Pentagons vs. triangles, *Discrete Math.*** 308** (2008), 4332–4336. (with E. Gyori)

Graphs and Hermitian matrices: exact interlacing, *Discrete Math*. **308** (2008), 4816–4821. (with V. Nikiforov)

Percolation on random Johnson-Mehl tessellations and related models,* Probab. Theory Related Fields* **140** (2008), 319–343. (with O. Riordan)

Percolation on dual lattices with k-fold symmetry, *Random Structures and Algorithms* **32** (2008), 463–472. (with O. Riordan)

Packing d-degenerate graphs,* J. Combin. Theory Ser. B* **98 ** (2008), 85–94. (with A. Kostochka and K. Nakprasit)

Joints in graphs,* Discrete Math*. **308** (2008), 9–19. (with V. Nikiforov)

Highly connected monochromatic subgraphs,* Discrete Math. ***308** (2008), 1722–1725. (with A. Gyarfas)

Eliminating cycles in the discrete torus, *Algorithmica* **50** (2008), 446– 454. (with G. Kindler, I. Leader and R. O’Donnell)

Connectivity of addable graph classes, *J. Combin. Theory Ser. B* **98 ** (2008), 577–584. (with P. Balister and S. Gerke)

An abstract Szemeredi regularity lemma. Building bridges, 219–240, *Bolyai Soc. Math. Stud.*, **19**, Springer, Berlin, 2008. 28Axx (with V. Nikiforov)

The phase transition in inhomogeneous random graphs, *Random Structures and Algorithms*** 31** (2007), 3–122. (with S. Janson and O. Riordan)

The generalized Randic index of trees,* J. Graph Theory* **56** (2007), 270–286. (P. Balister and S. Gerke)

Spread-out percolation in R^{d}, *Random Structures and Algorithms* **31** (2007), 239–246. (with S. Janson and O. Riordan)

Separating systems and oriented graphs of diameter two,* J. Combin. Theory, Ser. B* **97** (2007), 193–203. (with A. Scott)

On separating systems, *European J. Combin*. **28** (2007), 1068–1071. (with A. Scott)

Maximum directed cuts in acyclic digraphs, *J. Graph Theory* **55** (2007), 1–13. (with N. Alon, A. Gyarfas, J. Lehel, and A. Scott)

Hereditary properties of tournaments, *Electron. J. Combin. ***14 **(2007), Research Paper 60, 25pp. (electronic) (with J. Balogh and R. Morris)

Hereditary and monotone properties of combinatorial structures in *Surveys in combinatorics 2007*, 1–39,* London Math. Soc. Lecture Note Ser.*, **346**, Cambridge Univ. Press, Cambridge, 2007.

Essentially infinite colourings of hypergraphs,* Proc. Lond. Math. Soc*. **95** (2007), 709–734. (with Y. Kohayakawa, V. Rodl, M. Schact and A. Taraz)

Degree distribution of the FKP network model,* Theoret. Comput. Sci. ***379** (2007), 306–316. (with N. Berger, C. Borgs, J. Chayes, and O. Riordan)

Counting regions with bounded surface area, *Comm. Math. Phys.* **273** (2007), 305–315. (with P. Balister)

Cliques and the spectral radius, *J. Combin. Theory, Ser. B* **97** (2007), 859–865. (with V. Nikiforov)

A probabilistic counting lemma for complete graphs, *Random Structures Algorithms* **31** (2007), 517–534. (with S. Gerke, M. Marciniszyn and A. Steger)

A note on the Harris-Kesten theorem, *European J. Combin.* **28** (2007), 1720–1723. (with O. Riordan)

Proving integrability gaps without knowing the linear program, *Theory Comput.* **2** (2006), 19–51. (with S. Arora, L. Lovasz and I. Tourlakis)

The critical probability for random Voronoi percolation in the plane is 1/2, *Probab. Theory Related Fields* **136** (2006), 417–468. (with O. Riordan)

The angel and the devil in three dimensions, *J. Combin. Theory Ser. A* **113 **(2006), 176–184. (with I. Leader)

Sharp thresholds and percolation in the plane, *Random Structures and Algorithms ***29** (2006), 524–548. (with O. Riordan)

Regular subgraphs of random graphs, *Random Structures and Algorithms* **29** (2006), 1–13. (with J.H. Kim and J. Verstraete)

Ramsey-type theorems for metric spaces with applications to online problems, *J. Comput. System Sci.* **72** (2006), 890–921. (with Y. Bartal and M. Mendel)

Pair dominating graphs, *European J. Combin.*** 27** (2006), 322–328. (with P. Balister)

Large deviations for mean field models of probabilistic cellular automata, *Random Structures Algorithms ***29 **(2006), 399–415. (with P. Balister, and R. Kozma)

How many graphs are unions of k-cliques? *J. Graph Theory* **52** (2006), 87–107. (with G. R. Brightwell)

Hereditary properties of partitions, ordered graphs and ordered hypergraphs, *European J. Combin. ***27** (2006), 1263–1281. (with J. Balogh, B. Bollobas, and R. Morris)

Hereditary properties of ordered graphs, Topics in discrete mathematics, 179–213, *Algorithms Combin*., **26**, Springer, Berlin, 2006. (with J. Balogh and R. Morris)

Eliminating cycles in the discrete torus, LATIN 2006: Theoretical informatics, 202–210, *Lecture Notes in Comput. Sci.*, **3887**, Springer, Berlin, 2006. (with G. Kindler, I. Leader, and R. O’Donnell)

Discrepancy in graphs and hypergraphs, More sets, graphs and numbers, 33–56, *Bolyai Soc. Math. Stud*., **15,** Springer, Berlin, 2006. (with A.D. Scott)

Bootstrap percolation on the hypercube, *Probab. Theory Related Fields* **134** (2006), 624–648. (with J. Balogh)

A short proof of the Harris-Kesten theorem, *Bull. London Math. Soc.* **38** (2006), 470–484. (with O. Riordan)

Unavoidable traces of set systems, *Combinatorica* **25** (2005), 633–643. (with J. Balogh)

The sum of degrees in cliques, *Electron. J. Combin*. **12 **(2005) 10pp. (electronic) (with V. Nikiforov).

The phase transition in the uniformly grown random graph has infinite order, *Random Structures and Algorithms* **26** (2005); 1–36. (with S. Janson and O.M. Riordan)

Sparse distance preservers and additive spanners, *SIAM J. Discrete Math.* **19** (2005), 1029–1055 (electronic). (with D. Coppersmith and M. Elkin)

Slow emergence of the giant component in the growing m-out graph, *Random Structures and Algorithms*** 27 **(2005); 1–24. (with O. Riordan)

Phase transitions in the neuropercolation model of neural populations with mixed local and non-local interactions, *Biol. Cybernet. ***92** (2005), no. 6, 367–379. (with R. Kozma, M. Puljic, P. Balister and W. Freeman)

Percolation in Voronoi tilings, *Random Structures and Algorithms ***26** (2005); 310–318. (with P. Balister and A. Quas)

On two conjectures on packing of graphs, *Combin. Probab. Comput.*** 14** (2005), 723–736. (A. Kostochka and K. Nakprasit)

Integer sets with prescribed pairwise differences being distinct, *European Journal of Combinatorics* **26** (2005); 607–616. (with O. Pikhurko)

Hereditary properties of words, Theor. Inform. Appl.39 (2005); 49–65. (with J. Balogh)

Continuum percolation with steps in the square or the disc, *Random Structures and Algorithms* **26** (2005); 392–403. (with P. Balister and M. Walters)

Connectivity of random k-nearest-neighbour graphs, *Advances Applied Probability* **37 **(2005); pp 1–24. (with P. Balister, A. Sarkar, and M.Walters)

Books in graphs, *European J. Combin.* **26** (2005); 259–270. (with V. Nikiforov)

A jump to the Bell number for hereditary graph properties,* Journal Combinatorial Theory Series B* **95** (2005); 29–48. (with J. Balogh and D. Weinreich)

The number of graphs without forbidden subgraphs, *J. Combinatorial Theory Series B* **91** (2004); 1–24. (with J. Balogh and M. Simonovits)

The interlace polynomial of a graph,* J. Combinatorial Theory Series B ***92** (2004); 199–233. (with R. Arratia and G. Sorkin)

The diameter of a scale-free random graph, *Combinatorica* **24** (2004); 5–34. (with O. Riordan)

Robustness and vulnerability of scale-free random graphs, *Internet Math.* **1** (2003); 1–35.

On the value of a random minimum weight Steiner tree, *Combinatorica*** 24** (2004); 187–207. (with D. Gamarnik, O.M. Riordan, and B. Sudakov)

Multicolored extremal problems,* Journal of Combinatorial Theory, Series A* **107** (2004); 295–312. (with P. Keevash and B. Sudakov)

Max Cut for random graphs with a planted partition, *Combinatorics, Probability and Computing* **13** (2004); 451–474. (with A.D. Scott)

Judicious partitions of bounded-degree graphs, *J. Graph Theory* **46** (2004); 131–143. (with A.D. Scott)

Isoperimetric problems for r-sets,* Combinatorics, Probability and Computing* **13** (2004); 277–279. (with I. Leader)

How sharp is the concentration of the chromatic number? *Combinatorics, Probability, and Computing, *Problem Section. **13** (2004); 115–117.

Hermitian matrices and graphs: singular values and discrepancy, *Discrete Mathematics* **285** (2004); 17–32. (with V. Nikiforov)

Graphs and Hermitian matrices: eigenvalue interlacing, *Discrete Mathematics*** 289** (2004); 119–127. (with V. Nikiforov)

Degree powers in graphs with forbidden subgraphs, *Electronic Journal Combinatorics* **11** (2004); Research Paper 42, 8 pp. (electronic). (with V. Nikiforov)

Coupling scale-free and classical random graphs, *Internet Math .*

Continuum percolation with steps in an annulus, *Annals of Applied Probability*** 14** (2004); 1869–1879. (with P. Balister and M. Walters)

A two-variable interlace polynomial,* Combinatorica* **24** (2004); 567–584.

Union of shadows, Selected papers in honor of Lawrence Harper. *Theoret. Comput. Sci ***307** (2003), 493–502. (with I. Leader)

The number of k-SAT functions, *Random Structures and Algorithms*** 22** (2003), 366–373. (with G. Brightwell)

The number of graphs without forbidden subgraphs,* J. Combin. Theory Ser. B* **91** (2004), 1–24. (with J. Balogh and M. Simonovits)

The number of 2-SAT functions,* Israel J. Math*.** 133,** 2003, 45–60. (with G. Brightwell, and I. Leader)

Sharp thresholds in bootstrap percolation, *Physica A* **326** (2003), 305–312. (with J. Balogh)

Set systems with few disjoint pairs, *Combinatorica* **23** (2003), 559–570. (with Imre Leader)

Robustness and vulnerability of scale-free random graphs,* Internet Math.*** 1 **(2003), 1–35. (with O. Riordan)

Paths of length four, *Discrete Math.* **265** (2003), 357–363.(with A. Sarkar)

Maximum Cuts and judicious partitions in graphs without short cycles,* J. Combin. Theory Ser. B* **88** (2003), 329–346. (with N. Alon, M. Krivelevich, B. Sudakov)

Mathematical results on scale-free random graphs, *Handbook of graphs and networks*, Wiley-VCH, Weinheim,1–34, 2003. (with O. Riordan)

Graphs with large maximum degree containing no odd cycles of a given length,* Journal of Combinatorial Theory*, *Series B* **87** 2003, 366–373.

Economical covers with geometric applications, *Proc. London Math. Soc*. **86** (2003), 273–301. (with N. Alon, J. Kim, and V. Vu)

Disjointly representing set systems, *J. Combin. theory Ser. A*** 102** (2003), 1–9. (with O. Riordan)

Degree distribution of the FKP network model, Automata, languages and programming, 725–738, *Lecture Notes in Comput. Sci.*, **2719**, Springer, Berlin, 2003. (with N. Berger, C. Borgs, J. Chayes and O. Riordan)

Vertex distinguishing colorings of graphs with delta (G) = 2, *Discrete Mathematics* (2002) **252**; 17–19. (with P.N. Balister and R.H. Schelp)

The Erdos-Renyi theory of random graphs, *Paul Erdos and his mathematics, II* (Budapest, 1999), *Bolyai Soc. Math. Stud*., **11**, 2002, 79–134.

The interlace polynomial of graphs at -1,* European Journal of Combinatorics* (2002) **23**,761–767. (with P.N. Balister, J. Cutler and L. Pebody)

Random induced graphs, Discrete Math. 248, 2002, pp. 249–254. (with P. Erdos, R.J. Faudree, C. Rousseau, and R.H. Schelp)

Problems and results on judicious partitions, Random structures and algorithms (Poznan, 2001) Random Structures, and Algorithms (2002) **21**, pp. 414-430. (with A. Scott)

Measures on monotone properties of graphs, *Discrete Applied Mathematics ***116** (2002), 17–36.(with J. Balogh and D. Weinreich)

Girth of sparse graphs, *J. Graph Theory*, **39** (2002), pp. 194–200.

Game domination number, (English. English summary) ** ***Discrete Math.*** 256** (2002), 23–33. (with N. Alon, J. Balogh, and T. Szabo)

Evaluations of the circuit partition polynomial,* Journal of Combinatorial Theory Series B*, **85** (2002), 261–268.

Entropy along convex shapes, random tilings and shifts of finite type, *Illinois J. Math*. **46** (2002), 781–795.

Better bounds for Max Cut, *Contemporary combinatorics,* 185–246, *Bolyai Soc. Math. Stud.*, **10,** Janos Bolyai Math. Soc., Budapest, 2002.

A state space definition of the HOMFLY invariant, *Contemporary Combinatorics*, 139–184, *Bolyai Soc. Math. Stud.*, **10,** Janos Bolyai Math. Soc., Budapest, 2002. (with L. Pebody and D. Weinreich)

A polynomial of graphs on surfaces, *Math. Ann.* **323** (2002), 81–96. (with O. Riordan)

Time-series similarity problems and well-separated geometric sets, Nordic *J. Comput*. **8** (2001), 409–423. (with D. Gunopulos, G. Das, and H. Mannila)

The scaling window of the 2-SAT transition,* Random Structures Algorithms* **18** (2001), 201–256. (with C. Borgs, J.T. Chayes, J.H. Kim, and D. Wilson)

The penultimate rate of growth for graph properties, *European J. Combinatorics* **22** (2001), 277–289. (with J. Balogh and D. Weinreich)

The degree sequence of a scale-free random graph process, *Random Structures Algorithms* **18** (2001), 279–290. (with O. Riordan, J. Spencer, and G. Tusnady)

Paths in graphs, *Studia Sci. Math. Hungar. ***38** (2001), 115–137. (with A. Sarkar)

Dynamical percolation models of phase transitions in the cortex, *VOLTA*, Japan, October 2001.

Alternating knot diagrams, Euler circuits and the interlace polynomial, *European J. Combinatorics* **22** (2001), 1–4. (with P.N. Balister, O. M. Riordan, and A.D. Scott)

A Tutte polynomial for coloured graphs, (Matrahaza, 1995) In *Recent Trends in Combinatorics*, Cambridge University Press, Cambridge, 2001, 45–93. (with O. Riordan)

A polynomial invariant of the graphs on orientable surfaces, *Proc. London Math. Society ***83** (2001), 513–531.

The structure of hereditary properties and colourings of random Graphs, *Combinatorica* **20,** (2000), 173–202. (with A. Thomason)

The speed of hereditary properties of graphs, *Journal of Combinatorial Theory, Series B* 79 (2000), 131–156. (with J. Balogh and D. Weinreich)

Polychromatic polynomials, *Discrete Math.*** 219**, (2000), 1–7. (with O. Riordan)

On a conjecture involving cycle-complete graph Ramsey numbers, *Australas. J. Combin.* **22**, (2000), 63–71.(with C. Jayawardene, J. Yang, Y. Huang, C. Rousseau, and K. Zhang)

Minimizing the absolute upper shadow, in *Numbers, information and complexity* (Bielefeld, 1998), 95–100, Kluwer Acad. Publ., Boston, MA, 2000. (with I. Leader)

Local Mean Ramsey Numbers for Trees,* Journal of Combinatorial Theory, Series B*** 79** (2000), 100-103. (with A. Kostochka and A.H. Schelp)

Linearized chord diagrams and an upper bound for Vassiliev invariants, *Journal of Knot Theory and Its Ramifications* **9**, (2000), 847–853. (with O. Riordan)

Judicious Partitions of 3-uniform Hypergraphs, *European Journal of Combinatorics ***21** (2000), 289–300. (with A.D. Scott)

Euler circuits and DNA sequencing by hybridization, *Discrete Applied Mathematics*** 104** (2000), 63–96. (with R. Arratia, D. Coppersmith, and G. Sorkin).

Essentially Infinite Colourings of Graphs,* J. London Math. Soc.* **61** (2000), 658–670. ( with Y. Kohayakawa and R. Schelp)

Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at least k, *J. Graph Theory*** 34** (2000), 42–59. (with C, Cooper, T. Fenner, and A. Frieze)

Dependent percolation in two dimensions, *Probability Theory Relat. Fields*** 117 **(2000), 495–513. (with P. Balister and A. Stacey)

Contraction-deletion invariants for graphs, *J. Combin. Theory Ser. B* **80** (2000), 320–345. (with L. Pebody and O. Riordan)

Constrained graph processes, *Electron. J. Combin.* **7**, (2000), Research Paper 18, 20 pp. (electronic). (with O. Riordan)

Convex bodies, graphs and partial orders, *Proc. London Math. Society* **80 **(2000), 415–450. (with G. Brightwell)

Alternating knot diagrams, Euler Circuits and the Interlace Polynomial,* European Journal Combinatorics ***22**, 1–4. (with P.N. Balister, O.M. Riordan and A.D. Scott)

A note on generalized chromatic number and generalized girth, *Selected topics in discrete mathematics* (Warsaw, 1996), *Discrete Math*. **213** (2000), 29–34.

Weakly Pancyclic Graphs,* Journal of Combinatorial Theory, Series B* **77** (1999), 121–137.(with A. Thomason)

Turan’s theorem and maximal degrees,* J. Combinatorial Theory B* **75** (1999), 160–164.

The number of k-sums Modulo k, *Journal of Number Theory* **78** (1999), 27–35.

Geometrical techniques for estimating numbers of linear extensions, *Europ. J. Combinatorics* **20** (1999), 329–335. (with G. Brightwell and A. Sidorenko)

Extremal graphs for weights, *Discrete Mathematics*** 200** (1999), 5– 19.(with P. Erdos and A. Sarkar)

Exact bounds for judicious partitions of graphs,* Combinatorica* **19** (1999), 473–486. (with A.D. Scott)

Counting boundary paths for oriented percolation clusters, *Random Structures and Algorithms* **14** (1999), 1–28. (with P. Balister and A. Stacey)

Closure and Hamiltonian-connectivity of claw-free graphs, *Discrete Mathematics*** 195** (1999), 67–80. (with O. Riordan)

A Tutte polynomial for coloured graphs, *Combinatorics, Probability and Computing* (1999), **8**, 45–93. (with O. Riordan)

The oriented cycle game, *Discrete Mathematics* **186** (1998), 55–67.

Proof of a conjecture of Mader, Erdos and Hajnal on topological complete subgrapsh.* European Journ. Combinatorics* **19** (1998), 883–887. (with A. Thomason)

On some conjectures of Graffiti,* Discrete Mathematics*** 179** (1998), 223–230. (with O. Riordan)

Paul Erdos and probability theory,* Random Structures and Algorithms*** 13** (1998), 521–533.

Graphs of extremal weights, *Ars Combinatorica* **50** (1998), 225–233.

Colorings generated by monotone properties. *Random Structures and Algorithms* **12** (1998), 1–25. (with O. Riordan)

Volume estimates and rapid mixing, in *Flavors of Geometry*, No.** 31**, MSRI Publications Series, Cambridge University Press, 1997, pp. 151–182.

Time-series similarity and well-separated geometric sets, *Proceedings: 13th ACM Symp. on Computational Geometry *1997, 454–456. (with G. Das, D. Gunopulous and H. Mannila).

The structure of random graph orders,* Siam J. Discrete Math.* **10** (1997), 318–335. (with G. Brightwell)

The dimension of random graph orders, in* The Mathematics of Paul Erdos, II, Algorithms and Combinatorics* **14**, Springer, Berlin, 1997, pp. 51–69. (with G. Brightwell)

Random walks and electrical resistances in products of graphs, *Discrete Applied Mathematics* **73** (1997), 69–79. (with G. Brightwell)

Paul Erdos—life and work, in The Mathematics of Paul Erdos, I,* Algorithms and Combinatorics ***13**, Springer, Berlin, 1997, pp. 1–41.

On the length of the longest increasing subsequence in a random permutation, in *Combinatorics, Geometry and Probability – A Tribute to Paul Erdos *(B. Bollobas and A. Thomason, eds), Cambridge University Press, 1997, 121–128. (with S. Janson)

On the girth of Hamiltonian weakly pancyclic graphs, *J. Graph Theory*** 26** (1997), 165–173. (with A. Thomason)

On a problem of Erdos and G., *Discrete Mathematics* **175** (1997), 253–257. (with N. Hegyvari, and G. Jin)

Matchings and paths in the cube,* Discrete Appl. Math* **75** (1997), 1–8. (with I. Leader)

Judicious partitions of hypergraphs,* J. Combin. Theory Ser. A*** 78** (1997), 15–31 (with A. D. Scott)

Independent sets and repeated degrees, *Discrete Math. ***170** (1997), 41–49. (with A. D. Scott)

Hereditary and monotone properties of graphs, in *The Mathematics of Paul Erdos, II, Algorithms and Combinatorics ***14**, Springer, Berlin, 1997, pp. 70–78. (with A. Thomason)

Approximate upper bounds for the critical probability of oriented percolation in two dimensions based on rapidly mixing Markov chains, *Journal of Applied Probability* **34** (1997), 859–867. (with A. Stacey)

An Erdos–Ko–Rado theorem for signed sets, in Graph Theory in Computer Science, Chemistry, and other Fields (Las Cruces, NM, 1991). *Comput. Math. Appl.* **34** (1997), 9–13. (with I. Leader)

Turan-Ramsey problems,* Discrete Mathematics*** 156** (1996), 257–262.

The random-cluster model on the complete graph, *Probability Theory and Related Fields* **104** (1996), 283–317. (with G. Grimmett and S. Janson)

Sums in the grid, *Discrete Mathematics* **162 **(1996), 31–48. (with I. Leader)

Partition problems in additive number theory,* Journal of Number Theory* **56** (1996), 167–187. (with G. Jin)

On the best case of Heapsort,* J. Algorithms*** 20** (1996), 205–217 (with T.I. Fenner and A.M. Frieze)

Highly linked graphs, *Combinatorica* **16** (1996), 313–320. (with A. Thomason)

Degree multiplicities and independent sets in K4–free graphs, *Discrete Mathematics* **158** (1996), 27–35.

A proof of a conjecture of Bondy concerning paths of weighted digraphs,* Journal of Combinatorial Theory (B)*, **66** (1996), 283–292. (with A.D. Scott)

The width of random graph orders,*Mathematical Scientist ***20** (1995), 69–90. (with G. Brightwell)

The maximal number of induced r-partite subgraphs, *Graphs and Combinatorics *

Random high dimensional orders, *Advances in Applied Probability ***27** (1995), 161–184. (with G. Brightwell)

Projections of bodies and hereditary properties of hypergraphs, *Bulletin of the London Mathematical Society *

Products of unconditional bodies, in *Operator Theory: Advances and Applications*, Birkhauser Verlag, Basel, 1995, pp. 13–24. (with I. Leader)

Generalized chromatic numbers of random graphs, *Random Structures and Algorithms* **6** (1995), 353–356. (with A.G. Thomason)

Extremal graph theory, in* Handbook of Combinatorics*, Vol.2 (R.L. G., M. Grotschel and L. Lovasz, eds), North-Holland, 1995, pp. 1231–1292.

Defect Sauer results, *J. Combinatorial Theory (A*), **72 **(1995), 189–208. (with A.J. Radcliffe)

Connectivity properties of random subgraphs of the cube, *Random Structures and Algorithms* **6** (1995), 221–230. (with Y. Kohayakawa and T. Luczak)

Percolation in high dimensions,* European J. Combinatorics *

On the evolution of random Boolean functions, in *Extremal Problems for Finite Sets*, *Janos Bolyai Society Mathematical Studie*s **3 **(1994), 137–156. (with Y. Kohayakawa and T. Luczak)

On the diameter and radius of random subgraphs of the cube,* Random Structures and Algorithms* **5** (1994), 627–648. (with Y. Kohayakawa and T. Luczak)

Linear extensions of a random partial order,* Ann. of Applied Probability*** 4** (1994), 108-123. (with N. Alon, G. Brightwell and S. Janson)

Improved upper bounds for the critical probability of oriented percolation in two dimensions, *Random Structures and Algorithms* **5** (1994), 573–589. (with P. Balister and A. Stacey)

Extensions of the Erdos-Stone theorem, *Combinatorica* **14** (1994), 279– 286. (with Y. Kohayakawa)

Upper bounds for the critical probability of oriented percolation in two dimensions,* Proc. Royal Soc. London A ***440 **(1993), 201–220. (with P. Balister and A. Stacey)

The future of graph theory, in *Quo Vadis, Graph Theory?*, *Annals of Discrete Math*.** 55 **(1993), 5–12.

Ramsey problems in additive number theory,* Acta Arithmetica* **64** (1993), 341–355. (with P. Erdos and G. Jin)

Probabilistic analysis of disjoint set union algorithms,*SIAM J. of Computing* **22** (1993), 1053–1074. (with I. Simon)

Maximal sets of given diameter in the grid and the torus, *Discrete Mathematics*** 122** (1993), 15–35. (with I. Leader)

Judicious partitions of graphs, *Periodica Mathematica Hungarica*** 26** (1993), 127–139. (with A. Scott)

Generalized duals of unconditional spaces and Lozanovskii’s theorem,* Comptes Rendus de l’Academie des Sciences,* Paris, S´erie I, t.** 317 **(1993), 583–588. (with I. Leader)

Cycles through specified vertices, *Combinatorica* **13** (1993), 147– 155. (with G. Brightwell)

Connectivity and dynamics for random subgraphs of the directed cube, *Israel J. of Math.*** 83 **(1993), 321–328. (with C. Gotsman and E. Shamir)

Clique coverings of the edges of a random graph,* Combinatorica* **13** (1993), 1–5. (with P. Erd˝os, J. Spencer and D.B. West)

An extremal function for the achromatic number, in *Structural Graph Theory* (N. Robertson and O. Seymour, eds.) *Contemporary Mathematics*** 147**, American Mathematical Society, Providence, 1993, pp. 161–165. (with B. Reed and A.G. Thomason)

A partition problem of Erdos for integers, in Combinatorics, *Paul Erdos is eighty*, (D. Miklos, V.T. Sos and T. Szonyi, eds), vol. 1, *Bolyai Society Mathematical Studies*,* Janos Bolyai Mathematical Society*, Budapest,1993, pp. 79–89. (with G. Jin)

The height of a random partial order: concentration of measure,* The Annals of Applied Probability*** 2** (1992), 1009–1018. (with G. Brightwell)

The evolution of random subgraphs of the cube, *Random Structure and Algorithms* **3** (1992), 55–90. (with Y. Kohayakawa and T. Luczak)

Continuous restrictions of linear functionals, *Acta Universitatis Carolinae - Mathematica et Physica* **33** (1992), 37–38. (with I. Leader)

A travelling salesman problem in the k-dimensional unit cube,* Operations Res. Letters* **11** (1992), 19–21. (with A. Meir)

The hitting time of Hamilton cycles in random bipartite graphs, in *Graph Theory, Combinatorics, Algorithms, and Applications* (Y. Alavi, F.R.K. Chung, R.L. G. and D.F. Hsu, eds.), SIAM, Philadelphia, 1991, pp. 26–41. (with Y. Kohayakawa)

Spanning maximal subgraphs of random graphs, *Random Structures and Algorithms* **2** (1991), 225–231. (with A. M. Frieze)

Random graphs revisited, *Proceedings of Symposia in Applied Mathematics* **44** (1991), 81–97.

Random graphs, *Proceedings of Symposia in Applied Mathematics* **44** (1991), 1–19.

Isoperimetric inequalities and fractional set systems,* J. Combinatorial Theory (A)* **56** (1991), 63–74. (with I. Leader)

Graphs without large triangle-free subgraphs,*Discrete Mathematics* **87** (1991), 119–131. (with H. Hind)

Edge-isoperimetric inequalities in the grid, *Combinatorica*** 11** (1991), 299–314. (with I. Leader)

Compressions and isoperimetric inequalities,* J. Combinatorial Theory (A)* 56 (1991), 47–62. (with I. Leader)

Box-spaces and random partial orders,* Trans. Amer. Math. Soc.*** 324** (1) (1991), 59–72. (with G. Brightwell)

The cost distribution of clustering in random probing,* J. Assoc. Comp. Math.* **37** (1990), 224–237. (with A.Z. Broder and I. Simon)

The circumference of a graph with given minimal degree, in *A Tribute to Paul Erdos* (A. Baker, B. Bollob´as and A. Hajnal, eds), Cambridge University Press, 1990, pp. 99–106. (with R. H¨aggkvist)

Subgraph counts and containment probabilities of balanced subgraphs in a large random graph, in *Graph Theory and Its Applications, *New York Acad. Sci. vol**. 576** (1990), pp. 63–70. (with J. C. Wierman)

Sharp concentration of measure phenomena in the theory of randomgraphs, in *Random Graphs ’87* (M. Karonski, J. Jaworski and A. Rucinski, eds), John Wiley and Sons, 1990, pp. 1–15.

Powers of Hamilton cycles in tournaments, *Journal of Combinatorial Theory* (B) **50** (1990), 309–318. (with R. Haggkvist)

Parallel selection with high probability, *SIAM J. Disc. Math.* **3** (1990), 21–31. (with G.R. Brightwell)

On generalised minimal domination parameters for paths, *Discrete Mathematics* **86** (1990), 89–97. (with E.J. Cockayne and C.M. Mynhart)

Isoperimetric inequalities for faces of the cube and the grid, *Europ. J.Combinatorics ***11** (1990), 323–333. (with A.J. Radcliffe)

Hamilton cycles in random graphs of minimal degree at least k, in *A Tribute to Paul Erdos *(eds. A. Baker, B. Bollobas and A. Hajnal, eds), Cambridge University Press, 1990, pp. 59–95. (with T.I. Fenner and A.M. Frieze)

Exact face-isoperimetric inequalities,* Europ. J. Combinatorics ***11** (1990), 335–340. (with I. Leader)

An isoperimetric inequality on the discrete torus,* SIAM J. Disc. Math*.** 3 **(1990), 32–37. (with I. Leader)

Almost every graph has reconstruction number three,* J. Graph Theory*** 14** (1990), 1–4.

Reverse Kleitman inequalities, *Proc. London Math. Soc. *

Long cycles in graphs with no subgraphs of minimal degree three, *Discr. Math.* **78** (1989), 47–53. (with G.R. Brightwell)

Graphs with a small number of distinct induced subgraphs, *Discr. Math.* **75** (1989), 23–30. (with N. Alon)

First cycles in random directed graph processes, *Discr. Math.* **75** (1989), 55–68. (with S. Rasmussen)

An extension of the isoperimetric inequality on the sphere, *Elem. Math*.** 44** (1989), 121–124.

A new upper bound for the list chromatic number. Graph colouring and variations. *Discrete Math.*** 74** (1989), no. 1-2, 65–75. (with H.R. Hind)

Transitive orientations of graphs, *SIAM J. of Comp*. **17** (1988), 1119–1133. (with G.R. Brightwell)

The number of unrelated partitions,* J. Combinatorial Theory (A*) **49** (1988), 389–391.

The longest chain among random points in Euclidean Space,* Proc. Amer. Math. Soc. ***103** (1988), 347–353. (with P. Winkler)

The isoperimetric number of random regular graphs,* Europ. J. Combinatorics*** 9** (1988), 241–144.

The diameter of a cycle plus a random matching, *SIAM J. Discrete Math.* **1** (1988), 328–333. (with F.R.K.Chung)

The chromatic number of random graphs,*Combinatorica*** 8** (1988), 49–55.

Sorting in rounds, *Discrete Math*.** 72** (1988), 21–28.

Threshold functions,* Combinatorica*** 7** (1987), 35–38. (with A.G. Thomason)

Martingales, isoperimetric inequalities, and random graphs, in *Coll. Math. Soc. J. Bolyai, *Vol. **52**, Akad. Kiad´o, Budapest, 1987, pp. 113–139.

Graphs whose every transitive orientation contains almost every relation, *Israel J. Math.* **59** (1987), 112–128. (with G.R. Brightwell)

An algorithm for finding Hamilton cycles and paths in random graphs, *Combinatorica*** 7** (1987) 327–341. (with T.I. Fenner and A.M. Frieze)

The number of matchings in random regular graphs and bipartite graphs,* J. Combinatorial Theory (B)* **41** (1986), 80–91. (with B.D. McKay)

The maximal number of induced complete bipartite graphs, *Discrete Math. ***62** (1986), 271–275. (with C. Nara and S. Tachibana)

Random graphs and covering graphs of posets, *Order* **3 **(1986), 245– 255. (with G.R. Brightwell and J. Nesetril)

On the expected behaviour of disjoint set union algorithms, *Proc. 17th ACM Symp.* (1985), 224–231. (with I. Simon)

On matchings and Hamilton cycles, in *Random Graphs,Annals of Discr. Math.*, 1985, pp. 23–46. (with A.M. Frieze)

Repeated random insertion into the priority queue,* Journal of Algorithms* **9** (1985), 466–477. (with I. Simon)

Regular factors of regular graphs,* J. Graph Theory* **9** (1985), 97–104.(with A. Saito and N.C. Wormald)

Random graphs of small order, in Random Graphs,* Annals of Discr. Math*., **28** (1985), pp. 47–97. (with A.G. Thomason)

List-colourings of graphs,*Graphs and Combinatorics* **1** (1985), 115–127. (with A.J. Harris)

The irredundance number and the maximum degree of a graph,* Discrete Math.* **49** (1984), 197–199. (with E.J. Cockayne)

The evolution of sparse graphs, in *Graph Theory and Combinatorics*, Academic Press, 1984, pp. 35–57.

The evolution of random graphs, *Trans. Amer. Math. Soc.* **286** (1984), 257–274.

Sorting and graphs, in *Graphs and Order* (I. Rival, ed.), NATO ASI Series, Reidel, Dordrecht, Boston, Lancaster, 1984, pp. 169–184. (with P. Hell)

Rotation numbers for unions of circuits,* J. Graph Theory* **8** (1984), 69–81. (with E.J. Cockayne and Z.Y. Fang)

Long cycles in random graphs, in *Graph Theory and Combinatorics*, Academic Press, 1984, pp. 59–64. (with T.I. Fenner and A.M. Frieze)

Lectures on Random Graphs, in *Progress in Graph Theory* (J.A. Bondy U.S.R. Murty, eds), Academic Press, New York and London, 1984, pp. 3–41.

Inequalities for quadratic polynomials in Hermitian and dissipative operators, *Advances in Math.* **51** (1984), 271–280. (with J.R. Partington)

Geodesics in oriented graphs, *Ann. Discrete Math.* **20** (1984), 67–73.

Diameters of random bipartite graphs,* Combinatorica* **4** (1984), 7–19. (with V. Klee)

The evolution of the cube, in *Combinatorial Mathematics *(C. Berge, D. Bresson, P. Camion, J.F. Maurras and F. Sterboul, eds), North- Holland, Amsterdam, 1983, pp. 91–97.

Some remarks on packing trees, *Discr. Math*.** 46 **(1983), 203–204.

Parallel sorting, *Applied Discrete Mathematics*** 6 **(1983), 1–11. (with A.G. Thomason)

On Helly families of maximal size,* J. Combinatorial Theory (B) ***35** (1983), 290–296. (with P. Duchet)

On complete bipartite graphs contained in spanning tree complements, in *Studies in Pure Mathematics*, *Volume in Honour of P. Turan* (ed.-in-chief P. Erdos), Akademiai Kiado, Budapest, 1983, pp.83–90. (with F.R.K. Chung and R.L.G.)

On 4-cycles in random bipartite tournaments,* J. Graph Theory*** 7** (1983), 183–194. (with O. Frank and M. Karonski)

Equitable and proportional colourings of trees,* J. Combinatorial Theory (B)*** 34** (1983), 177–186. (with R.K. Guy)

Almost all regular graphs are Hamiltonian,* Europ. J. Combinatorics* **4** (1983), 97–106.

Vertices of given degree in a random graph,* J. Graph Theory* **6** (1982), 147–155.

The trail number of a graph, in *Graph Theory, Ann. Discrete Math. North-Holland* **13** (1982), 51–60. (with F. Harary)

The diameter of random regular graphs, *Combinatorica*** 2** (1982), 3–27. (with W.F. de la Vega)

The asymptotic number of unlabelled regular graphs, *J. London Math. Soc.* **89** (1982), 201–206.

More Rotation numbers for complete bipartite graphs,* J. Graph Theory* **6** (1982) 403–411. (with E.J. Cockayne)

Long paths in sparse random graphs, *Combinatorica* **2** (1982), 223–228

Distinguishing vertices of random graphs, in *Graph Theory, Ann. Discrete Math*. **13 **(1982), 33–50.

Topological cliques of random graphs, *J. Combinatorial Theory (B) *

Threshold functions for small subgraphs, *Math. Proc. Cambridge Phil. Soc.* **90** (1981), 197–206.

The size of connected hypergraphs with prescribed covering number,* J. Combinatorial Theory (B) ***31** (1981), 150–155. (with C. Thomassen)

The independence ratio of regular graphs,* Proc. Amer. Math. Soc*. **83** (1981), 433–436.

The diameter of random graphs, *Trans. Amer. Math. Soc. ***267** (1981), 41–52.

Sorting in one round*, Israel J. Math*. **38** (1981), 154–160. (with M. Rosenfeld)

Random graphs, in Combinatorics (H.N.V. Temperley ed.),* London Math. Soc. Lect. Note Series,* Vol. **52**, 1981, pp. 80–102.

Indestructive deletions of edges from graphs,* J. Combinatorial Theory (B)*** 30** (1981), 263–275. (with D.L. Goldsmith and D.R. Woodall)

Graphs which contain all small graphs,* Europ. J. Combin.*** 2** (1981), 13–15. (with A.G. Thomason)

Dense neighbourhoods and Turan’s theorem,* J. Combinatorial Theory (B) ***31** (1981), 111–114. (with A.G. Thomason)

Degree squences of random graphs, *Discrete Math.* **33** (1981), 1–19.

Counting coloured graphs of high connectivity,* Canad. J. Math.* **33** (1981), 476–484.

The distribution of the maximum degree of a random graph,* Discrete Math.* **32** (1980), 201–203.

Measure graphs, *J. London Math. Soc. *

Martingale inequalities, *Math. Proc. Cambridge Phil. Soc*.** 87** (1980), 377–382.

Hadwiger’s conjecture is true for almost every graph, *Europ. J. Combin*.** 1 **(1980), 195–199. (with P. Erdos and P.A. Catlin)

A probabilistic proof of an asymptotic formula for the number of labelled regular graphs, *Europ. J. Combin.*** 1 **(1980), 311–316.

The maximal size of the covering graph of a lattice, *Algebra Universalis ***9** (1979), 371–373. (with I. Rival)

Set colourings of graphs, *Discrete Math*. **25** (1979), 21–26. (with A.G. Thomason)

Optimal vertex partitions,* Bull. London Math. Soc.* **11** (1979), 113– 116. (with B. Manvel)

On graphs with equal edge-connectivity and minimum degree, *Discrete Math.*** 28 **(1979), 321–323.

Helly Families of maximal size, *J. Combinatorial Theory* (A)** 26** (1979), 197–200. (with P. Duchet)

Graph theoretic parameters concerning domination, independence and irredundance,* J. Graph Theory*** 3** (1979), 241–249. (with E.J. Cockayne)

Uniquely colourable graphs,* J. Combinatorial Theory (B) *

The number of 1-factors in 2k-connected graphs,* J. Combinatorial Theory* (B) **25** (1978), 363–366.

Packings of graphs and applications to computational complexity,* J. Combinatorial Theory (B)* **25** (1978), 105–124. (with S.E. Eldridge)

Nested cycles in graphs, *Problemes Combinatoires et Theorie des Graphes,* Edition CRNS, Paris, 1978, pp. 49–50.

Hamiltonian cycles in regular graphs, in *Advances in Graph Theory,* North-Holland, (1978), pp. 43–48. (with A.M. Hobbs)

*Extremal graphs without large forbidden subgraphs, in Advances in Graph Theory*, North-Holland, 1978, pp. 29–41. (with P. Erdos, M. Simonovits and E. Szemeredi)

Cycles and semi-topological configurations, in *Theory and Application of Graphs*, (Y. Alavi and D.R. Lick, eds.), *Lect. Notes in Math.* **642,** Springer, 1978, pp. 66–74.

Chromatic number, girth and maximal degree, *Discrete Math .*

Uniquely partitionable graphs,* J. London Math. Soc.* (2)** 16 **(1977), 403–410. (with A.G. Thomason)

Semi-topological subgraphs, *Discrete Math.*** 20** (1977), 83–85.

Extremal problems in graph theory,* J. Graph Theory*** 1** (1977), 117–123.

Disjoint triples in a 3-graph with given maximal degree, *Quart. J. Math. Oxford *(2)

Cycles modulo* k, Bull. London Math. Soc*. **9** (1977), 97–98.

Colouring lattices, *Algebra Universalis* **7** (1977), 313–314.

Almost all simplicial complexes are pure,* Utilitas Mathematica* **12** (1977), 101–111. (with E.M. Palmer)

Uniquely colourable graphs with large girth,* Canad. J. Math.* **28** (1976), 1340–1344. (with N. Sauer)

Strongly two-connected graphs, in *Proc. 7th S-E Conf. Combinatorics, Graph Theory and Computing, UtilitasMath*., Winnipeg, 1976, pp. 161–170.

Sets of independent edges of a hypergraph,* Quarterly J. Math. Oxford*** 21** (1976), 25–32. (with D.E. Daykin and P. Erdos)

Relations between sets of complete subgraphs, in *Proc. 5th Brit. Comb. Conf*. (Nash Williams, C. St. J. A. , and Sheehan, J., eds), *Utilitas Math*., Winnipeg, 1976, pp. 79–84.

On the structure of edgegraphs II, *J. London Math. Soc*.** 12 **(1976), 219–224. (with P. Erdos and M. Simonovits)

On graphs with diameter 2,* J. Combinatorial Theory *(B)** 21** (1976,) 201–205. (with S.E. Eldridge)

On Complete subgraphs of different orders, *Math. Proc. Cambridge* *Phil. Soc.* **79** (1976), 19–24.

On a Ramsey-Turan type problem,* J. Combinatorial Theory ***21** (1976), 166–168. (with P. Erdos)

Maximal matchings in graphs with given minimal and maximal degree,* Math. Proc. Cambridge Phil. Soc. ***79** (1976), 221–234. (with S.E. Eldridge)

Graphs with given diameter and minimal degree, *Ars Combinatoria* **2** (1976), 3–9.

Extremal graphs with given diameter and connectivity, *Ars Combinatoria* **1** (1976), 281–296. (with F. Harary)

Complete subgraphs are elusive, *J. Combinatorial Theory* (B) **21** (1976), 1–7.

Cliques in random graphs, *Math. Proc. Cambridge Phil. Soc.* **80 **(1976), 419–427. (with P. Erdos)

An inequality involving a Hermitian operator and its square in a normed space,* Bull. Soc. Math. Grece* **17** (1976), 44–49. (with S. Galanis)

Altenating Hamiltonian cycles,* Israel J. Math.*** 23** (1976), 126–131. (with P. Erdos)

The numerical ranges of unbounded linear operators,* Bull. Australian Math. Soc. ***12** (1975), 23–25. (with S.E. Eldridge)

Point arboricity critical graphs,* J. London Math. Soc.* (2) **12** (1975), 97–102. (with F. Harary)

Complete subgraphs of r-chromatic graphs, *Discrete Math. ***13** (1975), 97–107. (with P. Erdos and E. Szemeredi)

An extremal problem of graphs with diameter 2, *Math. Mag*. **48** (1975), 281–283. (with P. Erdos)

Three-graphs without two triples whose symmetric difference is contained in a third, *Discrete Math*.** 8** (1974), 21–24.

Representation of systems of measurable sets, *Math. Proc. Cambridge Phil. Soc.* **78** (1974), 324–325.

Normally subregular systems in normed algebras, *Studia. Math.* **49 **(1974), 263–266.

Complete subgraphs of chromatic graphs and hypergraphs*,Utilitas Math.*** 6** (1974) 343–347. (with P. Erdos and E.G. Straus)

Best possible bounds of the norms of inverses adjoined to normed algebras,* Studia. Math*.** 51** (1974), 85–94. (with N. Varopoulos)

The spectral decomposition of compact Hermitian operators on Banach spaces, *Bull. London Math. Soc.* **5** (1973), 29–36.

The spatial numerical range and powers of an operator, *J. London Math. Soc.* (2)** 7** (1973), 435–440.

The optimal arrangements of producers, *J. London Math. Soc*. (2), **6** (1973), 605–613.

Sperner systems consisting of pairs of complementary subsets, *J. Combinatorial Theory*** 15** (1973), 363–366.

On the structure of edge graphs, *Bull. London Math.Soc.*** 5** (1973), 317–321. (with P. Erdos)

On the numerical range of an operator, in *Stochastic Analysis and Stochastic Geometry I* (D.G. Kendall and E.F. Harding, eds.), John Wiley and Sons, (1973), pp. 374–385.

A theorem in transversal theory, *Bull. London Math. Soc. *

Adjoining inverses to commutative Banach algebras, *Transactions of Amer. Math. Soc. ***181** (1973), 165–174.

A characterisation of the circle and its applications to Hermitian operators,* Proc. Cambridge Phil. Soc. *

The optimal structure of market areas, *Econ. Theory* **4** (1972) 174–178. (with N. Stern)

Functionals close to each other, *Elem. Math. *

The power inequality in Banach spaces, *Proc. Cambridge Phil. Soc.*** 69** (1971), 411–415.

The numerical range in Banach algebras and entire functions of exponential type, . *Bull. London Math. Soc. *

Graphs with given diameter and maximal valency and with minimal number of edges, in *Combinatorial Mathematics and its Applications*, Acad. Press, London and New York, 1971, pp.25–37.

A property of Hermitian elements,* J. London Math. Soc.* **4** (1971), 379–380.

The maximal number of triangles of maximal perimeter length determined by a finite set, *Canad. Math. Bull. ***13** (1970), 19–20.

An extension to a theorem of Bishop and Phelps, *Bull. London Math. Soc*.** 2** (1970), 181–183.

A lower bound for the number of non-isomorphic matroids,* J. Combin. Theory ***7** (1969), 366–368.

*k*-tuples of the first n natural numbers, *Elem. Math.* **24** (1969), 133–134.

The area of a union of discs, *Elem. Math. ***23** (1968) 60–61.

Remarks to a paper of Fejes Toth, Studia. Sci. *Math. Hungar.* **3** (1968), 373–379.

Graphs of given diameter, in *Theory of Graphs* (G. Katona, P. Erdos, eds.), Akad. Kiado, Budapest, 1968, pp.83–98.

A problem of the theory of communication networks, *Acta. Math.** Acad. Sci. Hungar.*** 19** (1968), 75–80

Weakly* k*-saturated graphs, in *Proc. Coll. on Graph Theory, Ilmenau,* 1967, pp. 25–31.

On a conjecture of Erdos, Hajnal and Moon, *Amer. Math. Monthly ***74** (1967), 178–179.

Fixing systems for convex bodies,* Studia. Sci. Math. Hungar. 2* (1967), 351–354.

Determination of extremal graphs by using weights,* Wiss. Z. T. H. Ilmenau* **13** (1967), 419–421

An extremal problem for polygons inscribed in a convex curve,** ***Canad. J. Math*** . 19** (1967), 524–528.

Star domains, *Annales Univ. Sci. Budapest*** 9** (1966), 66–70.

On graphs with at most three independent paths connecting any two vertices, *Studia Sci. Math. Hungar. *

A generalisation of a theorem of Habicht and van der Waerden, *Annales Univ. Sci. Budapes*t **9** (1966), 61–65.

On generalized graphs, *Acta. Math. Acad. Sci. Hungar.*** 16** (1965), 447–452.

Graphs without two independent circuits (in Hungarian), *Mat. Lapok*** 15** (1964), 311–321.

Filling the plane with congruent convex hexagons without overlapping, *Annales Univ. Sci. Budapest* **6** (1963), 117–123.

Problems concerning extremal values in graph theory (in Hungarian), *Mat. Lapok* **13** (1962), 143–152. (with P. Erdos)

Covering the plane with congruent convex polygons, II (in Hungarian),* K. Mat. Lapok* **22** (1961), 152–160.

Covering the plane with congruent convex polygons I (in Hungarian),* K. Mat. Lapok* **22** (1961), 33–41.

Sparse distance preservers and additive spanners (extended abstract), *Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms* (Baltimore, MD, 2003), 414–423, ACM, New York, 2003. (with D. Coppersmith and M. Elkin)

Directed scale-free graphs, *Proceedings of the Fourteenth Annual ACMSIAM Symposium on Discrete Algorithms* (Baltimore, MD, 2003), 132– 139, ACM, New York, 2003. (with C. Borgs, J. Chayes and O. Riordan)

Combinatorics, probability and computing, in *Combinatorics, Probability Computing* Papers from the meeting held in Oberwolfach, 23-29 Sept 2001. **12** (2003), 329–346.

Hereditary properties of graphs: asymptotic enumeration, global structure, and coluring, *Proceedings of the International Congress of Mathematicians, Vol.III* (Berlin, 1998) *Doc. Math*.1998, 333–342.

Strictly ascending pairs and waves, in *Graph Theory, Combinatorics, and Applications: Proceedings of the Seventh Quadrennial International Conference on the Theory and Applications of Graphs* (Y. Alavi and A. Schwenk, eds.), Vol. 1, John Wiley and Sons, 1995, pp. 89–96. (with P. Erdos and G. Ji

Generalized chromatic numbers of random regular graphs, in *Graph Theory, Combinatorics and Algorithms: Proceedings of the Seventh Quadrennial International Conference on the Theory and Applications of Graphs* (Y. Alavi and A. Schwenk, eds.), Vol. 1, John Wiley and Sons, 1995, pp. 83–88. (with L. Clar

A note on long-range percolation, in *Graph Theory, Combinatorics, and Applications: Proceedings of the Seventh Quadrennial International Conference on the Theory and Applications of Graphs* (Y. Alavi and A. Schwenk, eds.), Vol. 1, John Wiley and Sons, 1995, pp. 97–113. (with Y. Kohayakaw

The diameter of graphs—a survey, in *Proc. 12th S-E Conf. Combinatorics, Graph Theory and Computing, Congressus Numerantium*** 32** (1982), 3–27. (with J.C. Bermond)

Partial sorting in one round, in *Proceedings of the 13th S-E Conf. in Combinatorics, Graph Theory and Computing*, *Congressus Numerantium* **35**, 1982, 239–242.

A biased Hamiltonian game, in *Proc. 13th S-E Conf. in Combinatorics, Graph Theory and Computing,* *Congressus Numerantium*** 35 **(1982), 105–116. (with A. Papaioannou)

The independence ratio and maximum degree of a graph, in *Proc. 7th SE Conf. Combinatorics, Graph Theory and Computing, Utilitas Math.*, Winnipeg, 1976, pp. 43–50. (with M. Albertson and S. Tucker)

Erratum to: Percolation on random Johnson-Mehl tessellations and related models. *Probab. Theory Related Fields ***146,** (2010), 567–570. (with O. Riordan)

Marking the 100th anniversary of the birth of Frank Ramsey, Special issue on Ramsey theory. Edited by Bela Bollobas, G. Brightwell, Yoshiharu Kohayakawa, Imre Leader and Alex Scott. *Combin. Probab. Comput.* **12** (2003), Cambridge University Press, Cambridge, 2003. pp. 467–70

Frank Ramsey. Special issue on Ramsey theory,* Combin. Probab. Comput.* **12** (2003), 469–475. (with A. Thomason)

__INVITED PRESENTATIONS__

Conferences

- Organizer of seven international conferences in Cambridge (the last in March 1993) on Combinatorics and Graph Theory, including the British Combinatorial Conference in 1977

- CBMS (Conference Board of Mathematical Sciences) Conference on Extremal Graph Theory: 10 lectures at a week-long meeting at Emory (Atlanta), June 1984.

- Organizer of the Littlewood Centenary Meeting in Cambridge in 1985.

- ARIDAM Conference: 10 lectures on Probabilistic Combinatorics at a week-long meeting at Rutgers, May 1986.

- Organizer of the short course Probabilistic Combinatorics and its Applications at the winter meeting of the AMS in January 1991, held in San Francisco.

- Co-organizer of the Durham meeting on Probabilistic Combinatorics in June 1991.

- Co-organizer of a special session at the AMS-LMS joint meeting in June 1992.

- Invited Speaker, Disordered Systems, Princeton, 1997

- Invited Speaker, AAAU Centenary Conference, Philadelphia, 1998

- Invited Speaker, International Combinatorial Conference, Tel Aviv, 1998

- Invited Speaker, International Combinatorial Conference, Prague, 1998

- Invited Speaker, International Congress of Mathematicians, Berlin, 1998

- Laudation, International Congress of Mathematicians, Berlin, 1998

- Rado Lecturer, Humboldt University, Berlin, 1998

- Organizer of International Workshop on Probabilistic Combinatorics, Erdos Institute, Budapest, 1998

- Invited Speaker, MSRI Extremal Combinatorics

- Co-organizer of the three-yearly meetings on Random Graphs at MFO in Oberwolfach, Germany

- Invited Speaker, MSRI Modern Aspects of Geometry: Short course and Evans Lecture

- Invited Speaker, London Mathematical Society, October 1998, London, UK

- Invited Speaker, The Institute for Advanced Study, Princeton, November 1998

- Co-organizer of a special session at the AMS meeting in San Antonio, January 1999

-Frontiers Lecturer, Texas A & M University, April 1999.

-Co-organizer of Special Session on Applied Probabilistic Combinatorics, American Mathematical Society meeting, Charlotte, Oct. 1999.

-Organizer of International Summer School on Statistical Physics and Probabilistic Methods in Computer Science and Plenary speaker, Trieste, Italy, August-September 1999

-Invited Speaker, Kombinatorik, Oberwolfach, Germany, February 2000.

-Erdos Lecture, Erdos Lecture Series, Hebrew University, Jerusalem, February 2000.

-Plenary Speaker, Thirty-first Southeastern International Conference on Combinatorics, Graph Theory, and Computing, March 2000

-Invited Speaker, Mississippi State University, Departmental Colloquium, March 2000

-Institute for Advance Study, Princeton, NJ, April 2000.

-Principal Speaker, Ninth Quadrennial International Conference on Graph Theory, Combinatorics, Algorithms, and Applications, Western Michigan University, June 2000

-September, 2000-Invited Speaker, 6th International Conference on Graph Theory, Marseilles, France

-Main Speaker, Conference in Honor of Szemeredi; -Budapest, Hungary, Renyi Institute of Math, October 2000

-Invited Lecturer at the Turan Memorial Conference, Renyi Institute, Budapest, October 2000

-Lectures, Budapest Semesters in Mathematics, Renyi Institute

Budapest Semesters in Math:, October 2000

-Lecturer at the Institute for Advanced Study, Princeton, NJ, November 2000

-Lecturer at the Institute for Defense Analysis, Princeton, NJ, November 2000

-Invited Lecturer at the Hajnal-Sos International Conference, January 2001

-Microsoft - Research collaboration with members of the Theory Group, January 2001

-Organizer, Erdos Lecture Series, University of Memphis, February 2001

-Invited Lecturer at the Hebrew University of Jerusalem,Institute of Computer Science, March 2001

-Microsoft - Research collaboration with members of the Theory Group, April 2001

-Opening Address, Rutgers University, DIMACS - "Graphs, Morphisms and Statistical Physics, March 2001

-Lecturer in the GAFA Seminar, Tel Aviv University, Israel, March 2001

-Plenary Speaker at Conference dedicated to G. Szekeres, Sidney, Australia, May 2001

-Main Speaker, Workshop on Graphs, Budapest, Hungary, June 2001

-Main Speaker, Conference on Set Systems, Budapest, Hungary, June 2001

-Plenary Speaker, Conference on Random Graphs, Poznan,Poland, August 2001

- Microsoft - Research collaboration with members of the Theory Group, August 2001

-Organizer, Conference on Combinatorics, Probability and Computing, Oberwolfach, Germany, September 2001

-Invited Researcher, Theory Group, Microsoft Research, Spring 2002.

-Lecturer, Workshop on Extremal Combinatorics, Zurich, Switzerland, January 2002

-Main talk, Network and Embedded Systems, DARPA, Napa, California, February 2002

-Closing lecture at the meeting on Large-Scale Networks at DIMACS, NJ, February 2002.

-Main talk, Instructional Conference on Combinatorial Aspects of Mathematical Analysis, Edinburgh, UK, March - April, 2002

- Lecturer and Organizer, Phase Transitions And Algorithmic Complexity, Institute for Pure and Applied Mathematics, UCLA, June 2002.

-Main talk, DARPA IXO, Networked Embedded Software Technology, Principal Investigators' Meeting, Bar Harbor, Maine, July 2002.

-Organizer and Presenter, Combinatorics, Graph Theory and Application, Satellite Conference of ICM, Beijing, China, August 2002.

-Lecturer, Statistical Physics, Probability theory and Computational Complexity School, The Abdus Salam International Centre for Theoretical Physics, Trieste, Italy, Aug-Sep 2002.

-Organizer, Michaelmus Lectures, University of Cambridge, Nov. 2002

-Main talk, DARPA IXO, Networked Embedded Software Technology, Principal Investigators' Meeting, Berkeley, CA.-January 2003

-Lecture, Foundations for Hybrid and Embedded Systems Software, Berkeley, CA-January 2003

-Presenter/Organize(judged the Rado Prize Competition, and presented the Rado prize)Dresden, Germany, Diskrete Mathematik, September 2002

-Plenary Lecture,AAAS meeting, Denver, Colorado, February 2003

-London Mathematical Society Lectures, Edinburgh Scotland, February 2003

-Research/Collaboration, Microsoft Research, Theory Group, Seattle, WA, March 2003

-Organizer, Erdos Lectures, University of Memphis, Memphis, TN, March 2003

-Lectures and Seminars, Institute for Advanced Study, Newark, NJ, April 2003

-Plenary Lecture, Chess: Center for Hybrid and Embedded Software Systems, Berkeley, CA, May 2003

-Organizer, plenary lecture, "Workshop on Algorithms and Models for the Web Graph", Budapest, Hungary, May 2003

-Opening Lecture, 16-20 June 2003, Workshop on Extremal Graphs, Hungary

-Organizer/Main Speaker, Workshop on Extremal Graph Theory (dedicated to the 60th birthday of Miklos Simonovits), Lake Balaton, Hungary, June 23-27, 2003:

-Plenary Lecture, June 29 - July 4, 2003, 19th British Combinatorial Conference (United Kingdom)

-The 11th International Conference on Random Structures and Algorithms, 9-13 August 2003, Poznan, Poland

- Lecturer, Eurocomb'03 - European conference on Combinatorics, Graph Theory and Applications , September 8-12, 2003 , Prague, Czech Republic

-Lecturer, Workshop on Algorithms and Models for the Web-Graph (WAW2003), Rome, August 2003

-Invited Researcher, Microsoft Research, Redmond, WA, 8 - 19th November.

-Lectures and Research, Institute for Advanced Study, 22 November - 9 December 2003, Princeton, NJ.

-Invited Talk, DARPA, 15 - 17 December 2004, Networked Software and Embedded Systems, Albequerque, NM

-Plenary Lecture, *Combinatorics*, Mathematisches Forschungsinstitut Oberwolfach, 5-9 January 2004, Oberwolfach, Germany.

-Lectures, Combinatoria, Probabilidade e Computacao, IMPA, Rio De Janeiro, Brazil, 12 - 14 February 2004

-Research, Microsoft Research, 6-18 March 2004

-Colloquium, University of Washington, "Random Geometrics Graphs", March 2004

-Organizer, Paul Erdos Memorial Lecture Series, University of Memphis, 26-27 March 2004

-Lectures, Swiss Federal Institute of Technology and University of Zurich, April 2004

-Lecture, Conference: “Complexity, Metastability and Nonextensivity”, Erice, Sicily (Italy), July 2004

-Lecturer/Organizer, “Mathematics in Zürich: from classical to modern”, Forshcungsinstitut für Mathematik, Zürich, Switzerland, 6-10 July 2004.

-Lectures and Workshops, Tel Aviv University, Jerusalem, ISRAEL, 18-26 October, 2004

-Invited talk, Emory University, Combinatorics Seminar, 28-31 October, 2005, Atlanta, Ga.

-Invited Talk, London Mathematical Society, Edinburgh, November 19, 2004.

-Lecturer, DARPA PI Meeting, Charleston, SC, 14-17 December, 2004.

-Invited talk, MSRI’s Phase Transitions in Computation and Reconstruction Workshop, Berkeley, California, March 7-11, 2005.

-Invited talk, University of Washington, April 2005.

-Lecturer, Combinatorics Seminar, Emory University, 2-6 April 2005, Atlanta, GA.

-Lectures and Research, Institute for Advanced Study, April, 2005 Princeton, NJ.

-Lectures and Workshops, Tel Aviv University, Jerusalem, ISRAEL, April, 2005.

-Invited Talk, Center for Hybrid and Embedded Software Systems, UC-Berkeley, May 11, 2005.

-Lecturer,Recent Trends of Combinatorics in the Mathematical Context, Mathematical Summer School, September 16 - 18, 2005 in Barcelona, Spain.

-Plenary Lecture, International Congress of Mathematicians, Departamento de Ingeniería Matemática, Centro de Modelamiento Matemático, Universidad de Chile, Santiago, Chile, March 2006

-Invited Lecturer, University of Chicago, April 2006

-Erdos Lecturer, “*Inhomogeneous Random Graphs”,* University of Notre
Dame, Notre Dame, Indiana,
April 2006

-Seminar Functional Anaylsis, “Random Voronoi Percolation”, Poincare Institute, Paris, France, April 2006

-Invited Lecture, International Congress of Mathematicians, Madrid, Spain, August 2006

-Organizer, Workshop: Random Graphs and Large-Scale Real-World Networks, National University of Singapore, May - June 2006.

-Invited Lecture, “Random geometric graphs”, Poincare Institute, Paris, France, July 4-5, 2006

-Invited Speaker, “Summer School and Workshop on Probabilistic Methods in Combinatorics”, National Research Network S9600 Analytic Combinatorics and Probabilistic Number Theory, Graz - Maria Trost (Austria), July 2006.

-Invited Speaker, EMS Summer School and Conference, Horizon of Combinatorics, Renyi Institute, Budapest July 10-15 and Lake Balaton July 16-22, 2006.

-International Congress of Mathematicians, Madrid (Spain), 22 - 30 August, 2006.

-Co-organizer, US-Hungarian workshop on Large-Scale Random Graph Methods for Modeling Mesoscopic Behavior in Biological and Physical Systems, Budapest, Hungary, 28 August – 4 September, 2006

-Presentation, MURI Kickoff Meeting, Berkeley, CA, Sept 24, 2006.

-Lecture/Presentation, Center for Hybrid Embedded Software Systems (Chess) ITR Review, Alexandria, VA, Oct. 4, 2006

-Workshop, Mathematisches Forschungsinstitut Oberwolfach, Combinatorics, Probability and Computing, Oct. 29-Nov. 4, 2006

-Invited Speaker, Quasi-random structures, regularity lemmas and their applications, Educational Workshop in the framework of Phenomena in High Dimensions Marie Curie Research Training Network, Budapest, Hungary, January 22-26 2007.

-Lecture, Workshop: Phase Transitions in Random Structures and Algorithms, Georgia Institute of Technology, Atlanta, GA, March 19 - 23, 2007.

-Organizer, Paul Erdos Lecture Series, University of Memphis, 23-24 March 2007.

-Rowlee Lecture, Howard Rowlee Lecture Series 2007 in the conference Random Combinatorial Structures: An International Conference on Random Methods in Combinatorics, University of Nebraska-Lincoln, 20-22 April 2007.

-Invited Talk, The 13^{th} International Conference
on Random Structures and Algorithms, Tel Aviv University, Tel Aviv, 28 May – 01
June 2007.

-Invited Speaker, London Combinatorics Conference (honouring Norman Biggs), London, England, UK, 16-17 May 2007.

-Invited Speaker, Extremal Combinatorics Workshop, Renyi Institute, Budapest, Hungary, June 4-8, 2007.

-Invited Speaker, British Combinatorial Conference was held at the University of Reading, Reading, UK, 8th to 13th July 2007

--Invited Talk, MURI, Project Meeting, Heterogeneous Sensor Webs for Automated Target Recognition and Tracking in Urban Terrain, MIT, 24 September 2007.

-Invited Talk, Seminar Research in Combinatorics, Tel Aviv University, Dept. of Mathematics and Computer Science, 28 October 2007.

-Invited Speaker, New Directions in Algorithms, Combinatorics and Optimization: A Conference Honoring the 65th Birthday of William T. Trotter , Georgia Tech, May 5-9, 2008

--Invited Speaker, 8th Panhellenic Conference in Algebra, Number theory and Applications, Athens, Greece, 29-31-May 2008,

-Invited Speaker, Joint International Meeting of the American Mathematical Society, Rio de Janeiro, Brazil, June 4-7, 2008

-Keynote Speaker, Combinatorial and Probabilistic Inequalities, Isaac Newton Institute for Mathematical Sciences, Cambridge, UK, 23 June to 27 June 2008.

-Invited lecture, “Bristol Summer School on Probabilistic Techniques in Computer Science”, Bristol, UK, 6 - 11 July 2008.

-Fete of Combinatorics and Computer Science, August 11 - 15, 2008, Keszthely, Lake Balaton

-Invited Speaker, Building Bridges, honouring the 60th birthday of Laci Lovász, August 5 - 9, 2008

- Project Meeting, Multidisciplinary Research Initiative Program (MURI), Heterogenous sensor webs for Automated target recognition and tracking in Urban Terrain, Vanderbilt University, Nashville, TN, 15 September 2008.

-Annual General Meeting of the London Mathematical Society, Friday 21 November 2008, London, UK.

-Invited Researcher, Institute for Advanced Study, Princeton, NJ, 6-15 December 2008.

-Invited Talk, Erdos Lecture, Tel Aviv University, April 2009.

-Organizer, “Combinatorics and Probability” workshop, Mathematisches Forschungsinstitut, Oberwolfach, Germany, May, 2009

-Invited speaker, conference dedicated to the 70^{th}
birthday of Vitaly Milman, “The state of geometry and functional analysis”, Tel
Aviv University and the Dead Sea Resort, Israel, 24-30 June, 2009.

- Invited lecture, 22nd British Combinatorial Conference, the University of St Andrews from the 5th to the 10th of July 2009, St. Andrews, UK

- Opening Speaker and Combinatorics Session Organizer, International Mathematical Olympiad, 10 to 22 July 2009, Bremen, Germany

-Organizer, University of Memphis, Study Abroad Program in Mathematics, Budapest, Hungary, July 18 – August 9, 2009.

-14^{th} International Conference on
Random Structures and Algorithms, Poznan, Poland, August 3-7, 2009.

-Invited Researcher, Multidisciplinary Research Initiative Program (MURI), Heterogenous sensor webs for Automated target recognition and tracking in Urban Terrain, Project Meeting, Vanderbilt University, September 9, 2009.

--Invited lecturer, Program on Combinatorics: Methods and Applications in Mathematics and Computer Science: "Probabilistic Techniques and Applications", Institute for Pure and Applied Mathematics (IPAM), UCLA, October 5 - November 9, 2009, Los Angeles, California.

--Murray/Olivier Lecture, Mississippi State University, Mississippi State, MS, November 13, 2009

-- Annual General Meeting of the London Mathematical Society, Institute of Education London, November 20, 2009

-- Invited Talk, Spatial Network Models for Wireless Communications, Isaac Newton Institute for Mathematical Sciences, Cambridge, UK, 6 April - 9 April 2010.

--Invited talk, Workshop on Convex and Stochastic Geometry, Karlsruhe Institute of Technology, The Church House of the --Protestant Academy Baden in Bad Herrenalb, Black Forest, Germany, May 30 - June 4, 2010.

--Invited talk, 8^{th} French Combinatorial
Conference, Orsay, France, 28 June – July 2, 2010.

-- 19th International Symposium on Mathematical Theory of Networks and Systems (MTNS 2010), Budapest, Hungary, 5-9 July 2010.

--Plenary lecture, A Conference in honor of the 70th birthday of Endre Szemerédi, Renyi Institute, Budapest, Hungary, 2-7 August 2010.

--PI Meeting, US Army Research Office Multidisciplinary Research Initiative (MURI) Program, project entitled “Heterogeneous Sensor Webs for Automated Target Recognition and Tracking in Urban Terrain”, Berkeley, CA, January 25, 2011

--Invited Seminar Speaker, University of Washington, Seattle, Washington, February 18, 2011

--Workshop Organizer and Plenary Speaker, "Hypergraph Turan Problems" workshop, American Institute of Mathematics, Pao Alto, CA, March 21-25, 2011

--Visiting Researcher, Microsoft Research, Redmond, Washington, January – April 2011

--Organizer, Erdős Lecture Series, University of Memphis, May 5-6, 2011

--Plenary Speaker, The 15th International Conference on Random Structures and Algorithms, Emory University, Atlanta, May 24-28, 2011

--Invited Participant, The 23rd British Combinatorial Conference, University of Exeter, Exeter, UK, 3rd to the 8th of July 2011

--Invited Speaker, Weekend Workshop on Matrix Theory, Departament of Mathematics at the University
of Coimbra, Portugal, July 9-10, 2011.

--Invited Speaker, Combinatorics Conference in Lisboa (CCL 2011), Lisbon, Portugual, 11-15 July, 2011

--Invited Speaker, 28 Brazilian Mathematics Colloquium, IMPA, Rio de Janeiro, Brazil, 18 to 29 July 2011

--Speaker (Workshop Organize), XV School of Probability, Mambucaba, Rio de Janeiro, Brazil, from July 31 – August 6, 2011

--Organizer: University of Memphis Math Study Abroad Program, 8 August -19 August 2011, Budapest, Hungary

--Keynote Speaker, Paul Turan Memorial Conference, August 22-26, 2011, Renyi Institute, Budapest, Hungary.

--European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB 11), August 29-September 2, 2011, Rényi Institute, Budapest, Hungary.

--Invited Speaker, A Conference in honor of the 70th birthday of Gyula Katona, September 3-4, 2011, Rényi Institute, Budapest, Hungary

--Visiting Researcher, Microsoft Research, Redmond, Washington, April – May 2012

--Shaw Prize Ceremony, Oslo, Norway, 21-23 May, 2012, the Awarding of the Abel Prize to Endre Szemeredi

-- Plenary Lecture, “One-Day Meeting in Combinatorics”, Mathematical Institute, University of Oxford, UK, 30 May 2012

--Visiting Researcher, 27 June – 7 July 2012, National University of Singapore, Singapore

--6-9 August 2012, 4th Emléktábla Workshop, Alfréd Rényi Institute of Mathematics, Budapest, Hungary.

-- Sep 3-7, Pisa, Italy, Workshop: “Geometry, Structure and Randomness in Combinatorics”

--60^{th} Anniversary of IMPA, 8^{th}-11th
October 2012, Rio de Janiero, Brazil

--15-21 October 2012, Ohio State University, Presented a series of workshops and seminars.

--3-4 November, 2012, Atlanta Lecture Series, Georgia Tech, Atlanta, Georgia

-- January – May 2013, Invited Researcher, Microsoft Research, Redmond, WA.

-- 14-20 April 2013, Oberwolfach Workshop - "Combinatorics and Probability", MFO, Oberwolfach, Germany

-- 17-20 June 2013, “Young Researchers in Mathematics 2013”, Edinburgh, UK

--Opening Lecture, Erdos Centennial Conference, July 1-5, 2013 , Renyi Institute, Budapest, Hungary

--Plenary Lecture, Centenary Conference dedicated to Israel Gelfand, Moscow, 22-25 July, 2013

--70^{th} Birthday Conference of Bela Bollobas,
University of Cambridge, UK, July 31 –
August 4, 2013

-- Special Invited Speaker, 16^{th }International
Conference on Random Structures and Algorithms, Poznan, Poland, 5-9 August, 2013.

- Programme Committee, Combinatorics Session Organizer, Eurocomb 2013 (European Conference on Combinatorics, Graph Theory and Applications-Eurocomb 2013), 9-13 September 2013, Pisa, Italy.

Opening lecture, Colloquium in Honor of the 60th birthday of Hans Jurgen Promel, ETH Zurich, 25-26 October 2013.

Invited Speaker, "Neighbourhood Family Percolation", Miki Simonovits is 70: A celebration with lectures, Renyi Inst., Budapest, Hungary, January 3-4, 2014

Plenary
talk, Trinity Mathematical Society, Cambridge, UK, January 2014.

Plenary talk, "“Percolation, Bootstrap Percolation, and Random Monotone Cellular Automata” , Canadian Mathematical Society Summer Meeting, Winnipeg, June 6-9, 2014

ACTIVITY | AGENCY/SOURCE | AMOUNT | PERIOD |
---|---|---|---|

Probabilistic and Extremal Combinatorics | National Science Foundation | 405,000 | 9/01/2016-8/31/2019 |

Random Geometric Graphs | National Science Foundation | 330,000 | 08/01/2013-07/31/2016 |

Conference: Contemporary Combinatorics 2012 | National Science Foundation | 19,000 | 04/01/2012-03/31/2013 |

Phase transitions for physical intelligence | DARPA | 384,926 | 11/1/2011-10/31/2013 |

Conference: Contemporary Combinatorics 2011 | National Science Foundation | 20,492 | 04/15/2011-03/31/2012 |

International Study Abroad Program in Combinatorics | National Science Foundation | 35,000 | 03/15/2011-02/29/2012 |

Conference: Contemporary Combinatorics 2010 | National Science Foundation | 20,000 | 03/01/2010-02/28/2011 |

Extremal and Probabilistic Graph Theory: Spectra, Subgraph Counts and Graph Sequences | National Science Foundation | 495,452 | 06/01/2009-12/31/2012 |

Conference: Contemporary Combinatorics 2008 | National Science Foundation | 17,000 | 04/15/2008-03/31/2009 |

Nets-NOSS: Collaborative Research | National Science Foundation | 421,509 | 09/01/2007-08/31/2012 |

Foundations of Coverage and Connectivity for Wireless Sensor Networks Deployed in Thin Strips | National Science Foundation | 350,000 | 09/15/2007-08/31/2011 |

Heterogenous Sensor Webs for Automated Target Recognition and Tracking in Urban Terrain | ARO | 250,000 | 05/01/2006--05/31/2016 |

US-Hungarian Mathematics Workshop on Large-Scale Random Graph Methods for Modeling Mesoscopic Behavior in Biological and Physical Systems | National Science Foundation | 40,000 | 9/01/2005-8/31/2007 |

Collaborative Research: Applications of Random Geometric Graphs to Large Ad Hoc Wireless Networks | National Science Foundation | 213,692 | 9/15/2005-8/31/2008 |

CBMS Conference: Expansion Methods in Combinatorics | National Science Foundation | 29,071 | 3/15/2003-10/31/2003 |

Foundations of Hybrid Embedded Software Systems | DARPA | 520,661 | 9/01/2002-8/31/2007 |

Percolation Model of Phase Transitions in the Central Nervous Systems during Perceptual Information Processing | National Science Foundation | 652,194 | 2/1/2002-1/31/2004 |

Phase transitions in combinatorial structures | DARPA | 640,868 | 6/01/2001-05/31/2005 |

Extremal and Probabilsitic Combinatorics | National Science Foundation | 85,029 | 6/1/1999-5/31/2002 |

ACTIVITY | AGENCY/SOURCE | AMOUNT | PERIOD |
---|---|---|---|

Center for Large-scale Integrated Optimization and Networks (CLION) | FedEx Institute of Technology, Univ. of Memphis Research Support | 2,500,000 | 7/01/2007-Present |

PROJECT | PARTICIPANTS | PERIOD | SPONSORSHIP |
---|---|---|---|

Preprint Series | Institute of Combinatorics, University of Memphis | 1996- | |

Erdos Memorial Lecture Series | Department of Mathematical Sciences Faculty, Graduate Students, local High Schools and Colleges and other national and international universities | Annually since 1997- |

UNIVERSITY | COMMITTEE/ACTIVITY | PERIOD |
---|---|---|

Department | Graduate Admissions Committee, University of Memphis | 1995-1998 |

College/School | ||

University | ||

COMMITTEE/EDITORIAL BOARD/OFFICE (if Chair, add [C]) | PERIOD | |

Cambridge Tracts in Mathematics | General Editor | 1988- |

Discrete Mathematics | Editor | |

London Mathematical Society | Editorial Advisor | 1980-1990 |

Combinatorics, Probability and Computing | Founder and Editor-in-Chief | 1992- |

European Journal of Combinatorics | Editor | |

Graphs and Combinatorics | Editor | |

Journal of Graph Theory | Editor | |

Random Structures and Algorithms | Editor | |

Electronic Journals of Combinatorics | Editor | |

Combinatorica | Editor |

ORGANIZATION/COMPANY | PERIOD |

Panel of Experts Evaluating the State of Mathematics in Portugal, Centro de Algebra da Universidade de Lisbona | July 1999 |

National Science Foundation, Combinatorics Panelist | January 2001 |

National Science Foundation, DMS Panelist | October 2002 |

National Science Foundation, Combinatorics Panelist | Decenber 2003 |

Harvard University, Department of Mathematics Hiring Committee | January 2005 |

National Science Foundation, Combinatorics Panelist | November 2006 |

The University of Hong Kong, Chief Examiner | 2007-2012 |

European Research Council | 2015-17 |

Academic Year (please indicate year) |
Course # | Course Name | Credit Hours | Percent Taught | Enroll | Labratory Supervised(S)/Instructed(I) | New Preparation (Y) /(N) |
---|---|---|---|---|---|---|---|

2017/2018 | 8236 | Probabilistic Combinatorics | 3.0 | 100 | 4 | y | |

2016/2017 | 8236 | Probabilistic Combinatorics | 3.0 | 100 | 8 | y | |

2014/2015 | 7032/8032 | Advanced Combinatorics | 3.0 | 100 | 11 | y | |

2013/2014 | 8024 | Probabilistic Combinatorics | 3.0 | 100 | 12 | Y | |

2013/2014 | 7024 | Probabilistic Combinatorics | 3.0 | 100 | 4 | Y | |

2013/2014 | 8821 | Special Problems in Mathematics | 3.0 | 100 | 12 | Y | |

2013/2014 | 7821 | Special Problems in Mathematics | 3.0 | 100 | 4 | Y | |

2011/2012 | 8043 | Probabilistic Inequalities | 3.0 | 100 | 12 | Y | |

2011/2012 | 7043 | Probabilistic Inequalities | 3.0 | 100 | 4 | Y | |

Functional Analysis | 100 | ||||||

Complex Variables | 100 | ||||||

Real Analysis | 100 | ||||||

Fields and Modules | 100 | ||||||

Graph Theory | 100 | ||||||

Group Theory | 100 | ||||||

Representation Theory | 100 | ||||||

Geometry of Banach Spaces | 100 | ||||||

Ergodic Theory | 100 | ||||||

Extremal Graph Theory | 100 | ||||||

Concentration Measure Phenomen | 100 | ||||||

Random Graph Theory I and II | 100 | ||||||

Polynomials of Graphs and Knots | 100 | ||||||

Phase Transitions | 100 | ||||||

Percolation Theory I and II | 100 |

Julian Sahasrabudhe (2017) - Junior Researcher, Peterhouse College, Cambridge (2017/2018), Postdoctoral Researcher, IMPA, Brazil (2018) |

Amy Shaw (2017) - Postdoctoral Researcher, University of Manitoba, Canada |

Teeradej Kittipassorn (2015) - Postdoctoral Researcher, Dept of Mathematics, Pontificia Universidade Catolica do Rio de Janeiro |

Tomas Juskevicius (2015) - Postdoctoral Researcher, Uppsala University, Sweden |

Richard Johnson (2015) - Instructor, The King's College - Canterbury, UK |

Dominik Vu (2014) - European Central Bank |

Ago-Erik Riet (2012) - Researcher, University of Tartu, Estonia |

Neal Bushaw (2012) - Visiting Assistant Professor, Arizona State University |

Andrew Uzzell (2012) - Postdoctoral Researcher, Uppsala University, Sweden |

Fabricio Benevides (2011) - Assistant Professor, Universidade Federal do Ceará, Brazil |

Karen Johannson (2011) - Postdoc, University of Bristol, UK |

Robert Morris (2006) - Assistant Researcher, IMPA, Brazil |

Henry Liu (2006) - Postdoc, Universidade Nova de Lisboa, Portugal |

Jonathan Cutler (2006) - Assistant Professor, Montclair State University |

Alice Hubenko (2004) - Postdoc, University of California, Santa Barbara |

Luke Pebody (2002) - Quantitative Analyst, Brevan Howard |

Jozsef Balogh (2001) - Professor, University of Illinois, Urbana/Chapaign |

David Weinreich (2000) - Consultant, Weinreich Strategic Group |

To prove and conjecture: Paul Erdos and his mathematics, American. Math. Monthly. 105 (1998), 209--237. |

The work of Timothy Gowers. Proceedings of the International Congress of Mathematicians. Vol 1. (Berlin, 1998), Doc. Math. 1998, 109--118. |

Paul Erdos: 26 March 1913 - 20 September 1996. Biographies of the Members and Fellows of the Royal Society of London. 45 (1999), 147--164. (with A. Baker) |

Introduction. (Papers from the 2009 Oberwolfach Meeting on Combinatorics and Probability). Held in Oberwolfach, April 26–May 2, 2009. Combinatorics, Probability and Computing 19 (2010), 641. (with N.Alon) |

Preface. Handbook of large-scale random networks, 9–14, Bolyai Soc. Math. Stud., 18, Springer, Berlin, 2009. (with R. Kozma and D. Miklos) |

Introduction. Papers from the 2006 Oberwolfach Meeting on Combinatorics, Probability and Computing. Held at the Mathematisches Forschungsinstitut, Oberwolfach, October 29–November 4, 2006. Combin. Probab. Comput. 18 (2009), 1. 05-06 (60-06). (with N. Alon) |