Robert Johnson

Interests

My research is in combinatorics. More specifically extremal problems for graphs and set systems. A particular interest which combines graphs and set systems is the combinatorics of the discrete hypercube. I have also worked in probabilistic combinatorics.

Publications

Submitted

• Turán and Ramsey Properties of Subcube Intersection Graphs (with Klas Markström)
  arXiv copy

Published

• An inductive construction for Hamilton cycles in Kneser graphs
  Electron. J. Combin. 18 (2011), no. 1, Paper 189.
  Journal copy


• The minimal density of triangles in tripartite graphs (with Rahil Baber and John Talbot)
  LMS J. Comput. Math., 13 (2010), 388-413.
  Journal copy, arXiv copy


• Random majority percolation (with Paul Balister, Béla Bollobás and Mark Walters)
  Random Structures and Algorithms, 36 (2010), 315-340.
  Journal Copy


• Vertex Turán problems in the hypercube (with John Talbot)
  J. Combin. Theory Ser. A, 117 (2010), 454-465.
  Journal copy, arXiv copy


• Universal cycles for permutations
  Discrete Math. 309 (2009), 5264-5270.
  Journal copy, arXiv copy


• G-intersection theorems for matchings and other graphs (with John Talbot)
  Combin. Probab. Comput., 17 (2008), 559-575.
  Journal copy


• Explicit 2-factorisations of the Odd Graph (with H A Kierstead)
  Order, 21 (2004), 19-27.
  Journal copy


• A disproof of the Fon-der-Flaass conjecture
  Combin. Probab. Comput., 13 (2004), 195-201.
  Journal copy


• Long cycles in the middle two layers of the discrete cube
  J. Combin. Theory Ser. A, 105 (2004), 255-271.
  Journal copy

Other Stuff

For the past few years I have been one of the organisers of the London Combinatorics Colloquia in May. This year's meetings were held on Wednesday 19 May (at Queen Mary) and Thursday 20 May (at LSE). More details here.

This page is maintained by Robert Johnson. The views and opinions expressed in these pages are mine. The contents of these pages have not been reviewed or approved by Queen Mary, University of London.