John M. Talbot

John Goldwasser, John M. Talbot: Vertex Ramsey Problems in the Hypercube. SIAM J. Discrete Math. 26(2): 838-853 (2012)

Rahil Baber, John M. Talbot: Hypergraphs Do Jump. Combinatorics, Probability & Computing 20(2): 161-171 (2011)

J. Robert Johnson, John M. Talbot: Vertex Turán problems in the hypercube. J. Comb. Theory, Ser. A 117(4): 454-465 (2010)

Dhruv Mubayi, John M. Talbot: Extremal Problems for t-Partite and t-Colorable Hypergraphs. Electr. J. Comb. 15(1) (2008)

J. Robert Johnson, John M. Talbot: G-Intersection Theorems for Matchings and Other Graphs. Combinatorics, Probability & Computing 17(4): 559-575 (2008)

David Talbot, John M. Talbot: Bloom Maps. ANALCO 2008: 203-212

John M. Talbot: Chromatic Turán problems and a new upper bound for the Turán density of Ks^-₄. Eur. J. Comb. 28(8): 2125-2142 (2007)

Peter Frankl, Yuejian Peng, Vojtech Rödl, John M. Talbot: A note on the jumping constant conjecture of Erdös. J. Comb. Theory, Ser. B 97(2): 204-216 (2007)

David Talbot, John M. Talbot: Bloom maps. CoRR abs/0710.3246 (2007)

John M. Talbot, Dominic J. A. Welsh: Complexity and cryptography - an introduction. Cambridge University Press 2006, isbn 978-0-521-61771-0, pp. I-XII, 1-292

John M. Talbot: The Intersection Structure of t-Intersecting Families. Electr. J. Comb. 12 (2005)

Fred C. Holroyd, Claire Spencer, John M. Talbot: Compression and Erdös-Ko-Rado graphs. Discrete Mathematics 293(1-3): 155-164 (2005)

Fred C. Holroyd, John M. Talbot: Graphs with the Erdös-Ko-Rado property. Discrete Mathematics 293(1-3): 165-176 (2005)

John M. Talbot: A new Bollobás-type inequality and applications to t-intersecting families of sets. Discrete Mathematics 285(1-3): 349-353 (2004)

John M. Talbot: The number of k-intersections of an intersecting family of r-sets. J. Comb. Theory, Ser. A 106(2): 277-286 (2004)

John M. Talbot: Lagrangians Of Hypergraphs. Combinatorics, Probability & Computing 11(2): 199-216 (2002)