default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn M. Talbot
Person information
- affiliation: University College London, Department of Mathematics
- affiliation: Oxford University, Merton College, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j21]Maria Axenovich, John L. Goldwasser, Bernard Lidický, Ryan R. Martin, David Offner, John M. Talbot, Michael Young:
Polychromatic Colorings on the Integers. Integers 19: A18 (2019)- 2018
- [j20]Maria Axenovich, John L. Goldwasser, Ryan Hansen
, Bernard Lidický, Ryan R. Martin, David Offner, John M. Talbot, Michael Young:
Polychromatic colorings of complete graphs with respect to 1-, 2-factors and Hamiltonian cycles. J. Graph Theory 87(4): 660-671 (2018) - 2017
- [j19]Allan Lo, Viresh Patel, Jozef Skokan, John M. Talbot:
Decomposing tournaments into paths. Electron. Notes Discret. Math. 61: 813-818 (2017) - 2015
- [j18]Adam Sanitt, John M. Talbot:
An Exact Turán Result for Tripartite 3-Graphs. Electron. J. Comb. 22(4): 4 (2015) - 2014
- [j17]Rahil Baber, John M. Talbot:
A Solution to the 2/3 Conjecture. SIAM J. Discret. Math. 28(2): 756-766 (2014) - 2012
- [j16]Rahil Baber, John M. Talbot:
New Turán Densities for 3-Graphs. Electron. J. Comb. 19(2): 22 (2012) - [j15]John L. Goldwasser, John M. Talbot:
Vertex Ramsey Problems in the Hypercube. SIAM J. Discret. Math. 26(2): 838-853 (2012) - 2011
- [j14]Rahil Baber, John M. Talbot:
Hypergraphs Do Jump. Comb. Probab. Comput. 20(2): 161-171 (2011) - 2010
- [j13]J. Robert Johnson, John M. Talbot:
Vertex Turán problems in the hypercube. J. Comb. Theory A 117(4): 454-465 (2010) - [j12]Rahil Baber, J. Robert Johnson, John M. Talbot:
The minimal density of triangles in tripartite graphs. LMS J. Comput. Math. 13: 388-413 (2010)
2000 – 2009
- 2008
- [j11]Dhruv Mubayi, John M. Talbot:
Extremal Problems for t-Partite and t-Colorable Hypergraphs. Electron. J. Comb. 15(1) (2008) - [j10]J. Robert Johnson, John M. Talbot:
G-Intersection Theorems for Matchings and Other Graphs. Comb. Probab. Comput. 17(4): 559-575 (2008) - [c1]David Talbot, John M. Talbot:
Bloom Maps. ANALCO 2008: 203-212 - 2007
- [j9]John M. Talbot:
Chromatic Turán problems and a new upper bound for the Turán density of Ks-4. Eur. J. Comb. 28(8): 2125-2142 (2007) - [j8]Peter Frankl, Yuejian Peng, Vojtech Rödl, John M. Talbot:
A note on the jumping constant conjecture of Erdös. J. Comb. Theory B 97(2): 204-216 (2007) - [i1]David Talbot, John M. Talbot:
Bloom maps. CoRR abs/0710.3246 (2007) - 2006
- [b1]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 - 2005
- [j7]John M. Talbot:
The Intersection Structure of t-Intersecting Families. Electron. J. Comb. 12 (2005) - [j6]Fred C. Holroyd, Claire Spencer, John M. Talbot:
Compression and Erdös-Ko-Rado graphs. Discret. Math. 293(1-3): 155-164 (2005) - [j5]Fred C. Holroyd, John M. Talbot:
Graphs with the Erdös-Ko-Rado property. Discret. Math. 293(1-3): 165-176 (2005) - 2004
- [j4]Magnus Bordewich, Charles Semple, John M. Talbot:
Counting consistent phylogenetic trees is #P-complete. Adv. Appl. Math. 33(2): 416-430 (2004) - [j3]John M. Talbot:
A new Bollobás-type inequality and applications to t-intersecting families of sets. Discret. Math. 285(1-3): 349-353 (2004) - [j2]John M. Talbot:
The number of k-intersections of an intersecting family of r-sets. J. Comb. Theory A 106(2): 277-286 (2004) - 2002
- [j1]John M. Talbot:
Lagrangians Of Hypergraphs. Comb. Probab. Comput. 11(2): 199-216 (2002)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
