Complexity and cryptography: an introduction J Talbot, D Welsh, DJA Welsh Cambridge University Press, 2006 | 153 | 2006 |

Hypergraphs do jump R Baber, J Talbot Combinatorics, Probability and Computing 20 (2), 161-171, 2011 | 103 | 2011 |

Lagrangians of hypergraphs JM Talbot Combinatorics, Probability and Computing 11 (2), 199-216, 2002 | 64 | 2002 |

Compression and Erdős–Ko–Rado graphs F Holroyd, C Spencer, J Talbot Discrete mathematics 293 (1-3), 155-164, 2005 | 56 | 2005 |

Graphs with the Erdős–Ko–Rado property F Holroyd, J Talbot Discrete mathematics 293 (1-3), 165-176, 2005 | 55 | 2005 |

Intersecting families of separated sets J Talbot Journal of the London Mathematical Society 68 (1), 37-51, 2003 | 50 | 2003 |

A note on the jumping constant conjecture of Erdős P Frankl, Y Peng, V Rödl, J Talbot Journal of Combinatorial Theory, Series B 97 (2), 204-216, 2007 | 33 | 2007 |

New Turán densities for 3-graphs R Baber, J Talbot the electronic journal of combinatorics, P22-P22, 2012 | 32 | 2012 |

A solution to the 2/3 conjecture R Baber, J Talbot SIAM Journal on Discrete Mathematics 28 (2), 756-766, 2014 | 29 | 2014 |

Chromatic Turán problems and a new upper bound for the Turán density of K4− J Talbot European Journal of Combinatorics 28 (8), 2125-2142, 2007 | 17 | 2007 |

Vertex Turán problems in the hypercube JR Johnson, J Talbot Journal of Combinatorial Theory, Series A 117 (4), 454-465, 2010 | 15 | 2010 |

Vertex Turán problems in the hypercube JR Johnson, J Talbot Journal of Combinatorial Theory, Series A 117 (4), 454-465, 2010 | 15 | 2010 |

A new Bollobás-type inequality and applications to t-intersecting families of sets J Talbot Discrete mathematics 285 (1-3), 349-353, 2004 | 11 | 2004 |

Extremal Problems for -Partite and -Colorable Hypergraphs D Mubayi, J Talbot the electronic journal of combinatorics, R26-R26, 2008 | 10 | 2008 |

The minimal density of triangles in tripartite graphs R Baber, JR Johnson, J Talbot LMS Journal of Computation and Mathematics 13, 388-413, 2010 | 9 | 2010 |

Polychromatic colorings on the hypercube J Goldwasser, B Lidický, RR Martin, D Offner, J Talbot, M Young arXiv preprint arXiv:1603.05865, 2016 | 7 | 2016 |

G-intersection theorems for matchings and other graphs JR Johnson, J Talbot Combinatorics, Probability and Computing 17 (4), 559-575, 2008 | 7 | 2008 |

Bloom maps D Talbot, J Talbot 2008 Proceedings of the Fifth Workshop on Analytic Algorithmics and …, 2008 | 7 | 2008 |

Counting consistent phylogenetic trees is# P-complete M Bordewich, C Semple, J Talbot Advances in Applied Mathematics 33 (2), 416-430, 2004 | 7 | 2004 |

On the density of 2‐colorable 3‐graphs in which any four points span at most two edges K Markström, J Talbot Journal of Combinatorial Designs 18 (2), 105-114, 2010 | 5 | 2010 |