Dr Robert Johnson
Senior Lecturer in Pure Mathematics
Lead for Communication and Public Engagement for Centre for Combinatorics, Algebra and Number Theory
School of Mathematical Sciences
Queen Mary University of London
Research
extremal combinatorics, graph theory, probabilistic combinatorics
Interests
Robert Johnson is a member of the Centre for Combinatorics, Algebra and Number Theory 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.
Publications

Publications of specific relevance to the Centre for Combinatorics, Algebra and Number Theory
2024
2023

Janzer B,
Johnson JR and Leader I (2023).
Partial Shuffles by Lazy Swaps. SIAM Journal on Discrete Mathematics,
Society for Industrial & Applied Mathematics (SIAM) vol. 37 (4), 2544-2557.
30-10-2023
Johnson JR and Wickes B (2023).
Shattering k-sets with Permutations. Order,
Springer Nature vol. 41 (2), 419-436.
20-06-20232020
Johnson JR and Pinto T (2020).
The $Q_2$-Free Process in the Hypercube. The Electronic Journal of Combinatorics,
The Electronic Journal of Combinatorics vol. 27 (4)
13-11-2020
Behague NC and
Johnson JR (2020).
Synchronizing Times for $k$-sets in Automata. 27-08-2020
Johnson J, Leader I and Long E (2020).
Correlation for permutations. Journal of Combinatorial Theory: Series A,
Elsevier vol. 175
28-04-20202017
JOHNSON JR, Leader I and
Walters M (2017).
Transitive Avoidance Games. The Electronic Journal of Combinatorics,
The Electronic Journal of Combinatorics 31-03-2017
JOHNSON JR and Day A (2017).
Multicolour Ramsey Numbers of Odd Cycles. Journal of Combinatorial Theory, Series B,
Academic Press vol. 124, 56-63.
16-01-20172016
JOHNSON JR (2016).
Saturated Subgraphs of the Hypercube. Combinatorics, Probability and Computing,
Cambridge University Press (CUP): STM Journals vol. 26 (1), 52-67.
19-09-20162014
JOHNSON JR, LEADER I and RUSSELL PA (2014).
Set Systems Containing Many Maximal Chains. Combinatorics Probability Computing,
Cambridge University Press (CUP) vol. 24 (3), 480-485.
09-10-20142013
Johnson JR and Markstrom K (2013).
Turan and Ramsey Properties of Subcube Intersection Graphs. COMBINATORICS PROBABILITY & COMPUTING vol. 22 (1), 55-70.
01-01-20132011
Johnson JR (2011).
An inductive construction for Hamilton cycles in Kneser graphs. ELECTRON J COMB vol. 18 (1)
20-09-20112010

Balister P, Bollobas B,
Johnson JR and
Walters M (2010).
Random Majority Percolation. RANDOM STRUCT ALGOR,
Wiley Online vol. 36 (3), 315-340.
01-05-2010
Johnson JR and Talbot J (2010).
Vertex Turan problems in the hypercube. J COMB THEORY A,
Elsevier/Science Direct vol. 117 (4), 454-465.
01-05-2010
Baber R,
Johnson JR and Talbot J (2010).
The minimal density of triangles in tripartite graphs. LMS J COMPUT MATH,
Cambridge Journals Online vol. 13, 388-413.
01-01-20102009
Johnson JR (2009).
Universal cycles for permutations. Discrete Mathematics,
Elsevier vol. 309 (17), 5264-5270.
01-09-20092008
Johnson JR and Talbot J (2008).
G-intersection theorems for matchings and other graphs. COMB PROBAB COMPUT vol. 17 (4), 559-575.
01-07-20082004
Johnson JR (2004).
A disproof of the Fon-der-Flaass conjecture. COMB PROBAB COMPUT vol. 13 (2), 195-201.
01-03-2004
JOHNSON JR and Kierstead HA (2004).
Explicit 2-Factorisations of the Odd Graph. Order vol. 21, 19-27.
01-02-2004
Johnson JR (2004).
Long cycles in the middle two layers of the discrete cube. J COMB THEORY A vol. 105 (2), 255-271.
01-02-2004