# John M. Talbot

According to our database

Collaborative distances:

^{1}, John M. Talbot authored at least 19 papers between 2002 and 2018.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepage:

#### On csauthors.net:

## Bibliography

2018

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

Journal of Graph Theory, 2018

2015

An Exact Turán Result for Tripartite 3-Graphs.

Electr. J. Comb., 2015

2014

A Solution to the 2/3 Conjecture.

SIAM J. Discrete Math., 2014

2012

Vertex Ramsey Problems in the Hypercube.

SIAM J. Discrete Math., 2012

New Turán Densities for 3-Graphs.

Electr. J. Comb., 2012

2011

Hypergraphs Do Jump.

Combinatorics, Probability & Computing, 2011

2010

Vertex Turán problems in the hypercube.

J. Comb. Theory, Ser. A, 2010

2008

*G*-Intersection Theorems for Matchings and Other Graphs.

Combinatorics, Probability & Computing, 2008

Extremal Problems for t-Partite and t-Colorable Hypergraphs.

Electr. 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, Ser. B, 2007

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.

Discrete Mathematics, 2005

Compression and Erdös-Ko-Rado graphs.

Discrete Mathematics, 2005

The Intersection Structure of t-Intersecting Families.

Electr. J. Comb., 2005

2004

The number of k-intersections of an intersecting family of r-sets.

J. Comb. Theory, Ser. A, 2004

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

Discrete Mathematics, 2004

2002

Lagrangians Of Hypergraphs.

Combinatorics, Probability & Computing, 2002