Dr Robert Johnson

Profile

Robert Johnson is a member of the Combinatorics group in the School of Mathematical Sciences. He has research interests in several areas of combinatorics, particularly extremal problems on graphs, set systems and permutations, and the combinatorics of the discrete hypercube.

Having completed his PhD at the University of Cambridge in 2003, he joined Queen Mary in 2004 following a brief spell at the London School of Economics.

Research

Publications

• JOHNSON JR, Leader I, Walters M (2017). Transitive Avoidance Games The Electronic Journal of Combinatorics.

  doi

  https://qmro.qmul.ac.uk/handle/123456789/22494
• JOHNSON JR, Day A (2017). Multicolour Ramsey Numbers of Odd Cycles Journal of Combinatorial Theory, Series B.

  10.1016/j.jctb.2016.12.005

  https://qmro.qmul.ac.uk/handle/123456789/18964
• JOHNSON JR (2016). Saturated Subgraphs of the Hypercube Combinatorics, Probability and Computing.

  10.1017/S0963548316000316

  https://qmro.qmul.ac.uk/handle/123456789/15713
• Johnson JR, Leader I, Russell PA (2015). Set Systems Containing Many Maximal Chains COMBINATORICS PROBABILITY & COMPUTING.

  10.1017/S0963548314000510

  qmroHref
• Johnson JR, Markstrom K (2013). Turan and Ramsey Properties of Subcube Intersection Graphs COMBINATORICS PROBABILITY & COMPUTING.

  10.1017/S0963548312000429

  qmroHref
• Johnson JR (2011). An inductive construction for Hamilton cycles in Kneser graphs ELECTRON J COMB.

  doi

  qmroHref
• Balister P, Bollobas B, Johnson JR et al. (2010). Random Majority Percolation RANDOM STRUCT ALGOR.

  10.1002/rsa.20281

  qmroHref
• Johnson JR, Talbot J (2010). Vertex Turan problems in the hypercube J COMB THEORY A.

  10.1016/j.jcta.2009.07.004

  qmroHref
• Baber R, Johnson JR, Talbot J (2010). The minimal density of triangles in tripartite graphs LMS J COMPUT MATH.

  10.1112/S1461157009000436

  qmroHref
• Johnson JR (2009). Universal cycles for permutations DISCRETE MATHEMATICS.

  10.1016/j.disc.2007.11.004

  qmroHref
• Johnson JR, Talbot J (2008). G-intersection theorems for matchings and other graphs COMB PROBAB COMPUT.

  10.1017/S0963548308009206

  qmroHref
• Johnson JR (2004). A disproof of the Fon-der-Flaass conjecture COMB PROBAB COMPUT.

  10.1017/S0963548303005960

  qmroHref
• JOHNSON JR, Kierstead HA (2004). Explicit 2-Factorisations of the Odd Graph Order.

  10.1007/s11083-004-3344-x

  qmroHref
• Johnson JR (2004). Long cycles in the middle two layers of the discrete cube J COMB THEORY A.

  10.1016/j.jeta.2003.11.004

  qmroHref

PhD Supervision

Previous PhD students supervised:

• Trevor Pinto (completed 2016)
• A Nicholas Day (completed 2017)

Current PhD students:

• Natalie Behague

I welcome enquiries from potential PhD applicants.