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

• Equilibria in a Hypercube Spatial Voting Model (with Nick Day)
  arXiv copy

• Asymmetry of 2-step Transit Probabilities in 2-Coloured Regular Graphs (with Ron Gray)
  arXiv copy

• Matchings and Hamilton Cycles with Constraints on Sets of Edges
  arXiv copy

Published

• Optimal Resistor Networks (with Mark Walters)
  Mathematika 70 (2024), Issue 4, e12278.
  Journal copy, arXiv copy

• Partial shuffles by lazy swaps (with Barnabás Janzer and Imre Leader)
  SIAM Journal on Discrete Mathematics 37 (2023), Issue 4.
  Journal copy, arXiv copy

• Partial Shattering for Permutations (with Belinda Wickes)
  Order, (2023).
  Journal copy, arXiv copy

• Synchronizing Times for k-sets in Automata (with Natalie Behague)
  Electron. J. Combin. 29 (2022), Issue 3, P3.41.
  Journal copy, arXiv copy

• The Q₂-free process in the hypercube (with Trevor Pinto)
  Electron. J. Combin. 27 (2020), Issue 4, P4.32.
  Journal copy, arXiv copy

• Correlation for Permutations (with Imre Leader and Eoin Long)
  J. Combin. Theory Ser. A, 175 (2020), 105260.
  Journal copy, arXiv copy

• Transitive Avoidance Games (with Imre Leader and Mark Walters)
  Electron. J. Combin. 24 (2017), Issue 1, P1.61.
  Journal copy, arXiv copy

• Multicolour Ramsey Numbers of Odd Cycles (with Nick Day)
  J. Combin. Theory Ser. B, 124 (2017), 56-63.
  Journal copy, arXiv copy

• Saturated Subgraphs of the Hypercube (with Trevor Pinto)
  Combin. Probab. Comput., 26 (2017), 52-67.
  Journal copy, arXiv copy

• Set Systems Containing Many Maximal Chains (with Imre Leader and Paul A Russell)
  Combin. Probab. Comput., 24 (2015), 480-485.
  Journal copy, arXiv copy

• Turán and Ramsey Properties of Subcube Intersection Graphs (with Klas Markström)
  Combin. Probab. Comput., 22 (2013), 55-70.
  Journal copy, arXiv copy

• 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

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.