Tom Johnston

Tom Johnston

University of Oxford

H-index: 5

Europe-United Kingdom

About Tom Johnston

Tom Johnston, With an exceptional h-index of 5 and a recent h-index of 5 (since 2020), a distinguished researcher at University of Oxford, specializes in the field of Combinatorics.

His recent articles reflect a diverse array of research interests and contributions to the field:

The rainbow saturation number is linear

A note on the invertibility of oriented graphs

A polynomial upper bound for poset saturation

Game Connectivity and Adaptive Dynamics

Decomposing random permutations into order-isomorphic subpermutations

Counting graphic sequences via integrated random walks

Shotgun assembly of random graphs

Reconstructing the degree sequence of a sparse graph from a partial deck

Tom Johnston Information

University

Position

___

Citations(all)

55

Citations(since 2020)

54

Cited By

4

hIndex(all)

5

hIndex(since 2020)

5

i10Index(all)

0

i10Index(since 2020)

0

Email

University Profile Page

Google Scholar

Tom Johnston Skills & Research Interests

Combinatorics

Top articles of Tom Johnston

The rainbow saturation number is linear

SIAM Journal on Discrete Mathematics

2024/6/30

Tom Johnston
Tom Johnston

H-Index: 1

A note on the invertibility of oriented graphs

arXiv preprint arXiv:2404.10663

2024/4/16

Tom Johnston
Tom Johnston

H-Index: 1

A polynomial upper bound for poset saturation

arXiv preprint arXiv:2310.04634

2023/10/7

Game Connectivity and Adaptive Dynamics

arXiv preprint arXiv:2309.10609

2023/9/19

Tom Johnston
Tom Johnston

H-Index: 1

Alex Scott
Alex Scott

H-Index: 18

Decomposing random permutations into order-isomorphic subpermutations

SIAM Journal on Discrete Mathematics

2023/6/30

Counting graphic sequences via integrated random walks

arXiv preprint arXiv:2301.07022

2023/1/17

Shotgun assembly of random graphs

arXiv preprint arXiv:2211.14218

2022/11/25

Reconstructing the degree sequence of a sparse graph from a partial deck

Journal of Combinatorial Theory, Series B

2022/11/1

Short reachability networks

arXiv preprint arXiv:2208.06630

2022/8/13

Perfect shuffling with fewer lazy transpositions

arXiv preprint arXiv:2208.06629

2022/8/13

Exact antichain saturation numbers via a generalisation of a result of Lehman-Ron

arXiv preprint arXiv:2207.07391

2022/7/15

Improved bounds for 1-independent percolation on

arXiv preprint arXiv:2206.12335

2022/6/24

Tom Johnston
Tom Johnston

H-Index: 1

Alex Scott
Alex Scott

H-Index: 18

The lengths for which bicrucial square-free permutations exist

arXiv preprint arXiv:2109.00502

2021/9/1

Carla Groenland
Carla Groenland

H-Index: 4

Tom Johnston
Tom Johnston

H-Index: 1

Exact hyperplane covers for subsets of the hypercube

Discrete Mathematics

2021/9/1

Cyclically covering subspaces in

Journal of Combinatorial Theory, Series A

2021/7/1

Reconstruction from smaller cards

arXiv preprint arXiv:2103.13359

2021/3/24

Exceptional graphs for the random walk

2020/8/1

Zero-sum squares in -matrices with low discrepancy

arXiv preprint arXiv:2010.10310

2020/10/20

Tom Johnston
Tom Johnston

H-Index: 1

Intersection sizes of linear subspaces with the hypercube

Journal of Combinatorial Theory, Series A

2020/2/1

Carla Groenland
Carla Groenland

H-Index: 4

Tom Johnston
Tom Johnston

H-Index: 1

Lipschitz bijections between boolean functions

Combinatorics, Probability and Computing

2020

Tom Johnston
Tom Johnston

H-Index: 1

Alex Scott
Alex Scott

H-Index: 18

See List of Professors in Tom Johnston University(University of Oxford)

Co-Authors

academic-engine