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.
Integers, 2019

2018
Polychromatic colorings of complete graphs with respect to 1-, 2-factors and Hamiltonian cycles.
J. Graph Theory, 2018

2017
Decomposing tournaments into paths.
Electron. Notes Discret. Math., 2017

2015
An Exact Turán Result for Tripartite 3-Graphs.
Electron. J. Comb., 2015

2014
A Solution to the 2/3 Conjecture.
SIAM J. Discret. Math., 2014

2012
Vertex Ramsey Problems in the Hypercube.
SIAM J. Discret. Math., 2012

New Turán Densities for 3-Graphs.
Electron. J. Comb., 2012

2011
Hypergraphs Do Jump.
Comb. Probab. Comput., 2011

2010
The minimal density of triangles in tripartite graphs.
LMS J. Comput. Math., 2010

Vertex Turán problems in the hypercube.
J. Comb. Theory A, 2010

2008
<i>G</i>-Intersection Theorems for Matchings and Other Graphs.
Comb. Probab. Comput., 2008

Extremal Problems for t-Partite and t-Colorable Hypergraphs.
Electron. J. Comb., 2008

Bloom Maps.
Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics, 2008

2007
A note on the jumping constant conjecture of Erdös.
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>.
Eur. J. Comb., 2007

2006
Complexity and cryptography - an introduction.
Cambridge University Press, ISBN: 978-0-521-61771-0, 2006

2005
Graphs with the Erdös-Ko-Rado property.
Discret. Math., 2005

Compression and Erdös-Ko-Rado graphs.
Discret. Math., 2005

The Intersection Structure of t-Intersecting Families.
Electron. J. Comb., 2005

2004
The number of k-intersections of an intersecting family of r-sets.
J. Comb. Theory A, 2004

A new Bollobás-type inequality and applications to t-intersecting families of sets.
Discret. Math., 2004

Counting consistent phylogenetic trees is #P-complete.
Adv. Appl. Math., 2004

2002
Lagrangians Of Hypergraphs.
Comb. Probab. Comput., 2002


  Loading...