We stand with Ukraine  

John M. Talbot

Orcid: 0000-0002-4119-9429

Affiliations:
  • University College London, Department of Mathematics
  • Oxford University, Merton College, UK


According to our database1, John M. Talbot authored at least 23 papers between 2002 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Polychromatic Colorings on the Integers.
[BibTeX]
[DOI]
Maria Axenovich
,
John L. Goldwasser
,
Bernard Lidický
,
Ryan R. Martin
,
David Offner
,
John M. Talbot
,
Michael Young
Integers, 2019

2018
Polychromatic colorings of complete graphs with respect to 1-, 2-factors and Hamiltonian cycles.
[BibTeX]
[DOI]
Maria Axenovich
,
John L. Goldwasser
,
Ryan Hansen
,
Bernard Lidický
,
Ryan R. Martin
,
David Offner
,
John M. Talbot
,
Michael Young
J. Graph Theory, 2018

2017
Decomposing tournaments into paths.
[BibTeX]
[DOI]
Allan Lo
,
Viresh Patel
,
Jozef Skokan
,
John M. Talbot
Electron. Notes Discret. Math., 2017

2015
An Exact Turán Result for Tripartite 3-Graphs.
[BibTeX]
[DOI]
Adam Sanitt
,
John M. Talbot
Electron. J. Comb., 2015

2014
A Solution to the 2/3 Conjecture.
[BibTeX]
[DOI]
Rahil Baber
,
John M. Talbot
SIAM J. Discret. Math., 2014

2012
Vertex Ramsey Problems in the Hypercube.
[BibTeX]
[DOI]
John L. Goldwasser
,
John M. Talbot
SIAM J. Discret. Math., 2012

New Turán Densities for 3-Graphs.
[BibTeX]
[DOI]
Rahil Baber
,
John M. Talbot
Electron. J. Comb., 2012

2011
Hypergraphs Do Jump.
[BibTeX]
[DOI]
Rahil Baber
,
John M. Talbot
Comb. Probab. Comput., 2011

2010
The minimal density of triangles in tripartite graphs.
[BibTeX]
[DOI]
Rahil Baber
,
J. Robert Johnson
,
John M. Talbot
LMS J. Comput. Math., 2010

Vertex Turán problems in the hypercube.
[BibTeX]
[DOI]
J. Robert Johnson
,
John M. Talbot
J. Comb. Theory A, 2010

2008
<i>G</i>-Intersection Theorems for Matchings and Other Graphs.
[BibTeX]
[DOI]
J. Robert Johnson
,
John M. Talbot
Comb. Probab. Comput., 2008

Extremal Problems for t-Partite and t-Colorable Hypergraphs.
[BibTeX]
[DOI]
Dhruv Mubayi
,
John M. Talbot
Electron. J. Comb., 2008

Bloom Maps.
[BibTeX]
[DOI]
David Talbot
,
John M. Talbot
Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics, 2008

2007
A note on the jumping constant conjecture of Erdös.
[BibTeX]
[DOI]
Peter Frankl
,
Yuejian Peng
,
Vojtech Rödl
,
John M. Talbot
J. Comb. Theory B, 2007

Chromatic Turán problems and a new upper bound for the Turán density of Ks<sup>-</sup><sub>4</sub>.
[BibTeX]
[DOI]
John M. Talbot
Eur. J. Comb., 2007

2006
Complexity and cryptography - an introduction.
[BibTeX]
John M. Talbot
,
Dominic J. A. Welsh
Cambridge University Press, ISBN: 978-0-521-61771-0, 2006

2005
Graphs with the Erdös-Ko-Rado property.
[BibTeX]
[DOI]
Fred C. Holroyd
,
John M. Talbot
Discret. Math., 2005

Compression and Erdös-Ko-Rado graphs.
[BibTeX]
[DOI]
Fred C. Holroyd
,
Claire Spencer
,
John M. Talbot
Discret. Math., 2005

The Intersection Structure of t-Intersecting Families.
[BibTeX]
[DOI]
John M. Talbot
Electron. J. Comb., 2005

2004
The number of k-intersections of an intersecting family of r-sets.
[BibTeX]
[DOI]
John M. Talbot
J. Comb. Theory A, 2004

A new Bollobás-type inequality and applications to t-intersecting families of sets.
[BibTeX]
[DOI]
John M. Talbot
Discret. Math., 2004

Counting consistent phylogenetic trees is #P-complete.
[BibTeX]
[DOI]
Magnus Bordewich
,
Charles Semple
,
John M. Talbot
Adv. Appl. Math., 2004

2002
Lagrangians Of Hypergraphs.
[BibTeX]
[DOI]
John M. Talbot
Comb. Probab. Comput., 2002


  Loading...