John M. Talbot

23 papers Journal 21Unranked 1

Year	Rank	Type	Title / Venue / Authors
2019	J	`jnl`	Polychromatic Colorings on the Integers. Integers Maria Axenovich, John L. Goldwasser, Bernard Lidický, Ryan R. Martin, David Offner, John M. Talbot, Michael Young
2018	J	`jnl`	Polychromatic colorings of complete graphs with respect to 1-, 2-factors and Hamiltonian cycles. J. Graph Theory Maria Axenovich, John L. Goldwasser, Ryan Hansen, Bernard Lidický, Ryan R. Martin, David Offner, John M. Talbot, Michael Young
2017	J	`jnl`	Decomposing tournaments into paths. Electron. Notes Discret. Math. Allan Lo, Viresh Patel, Jozef Skokan, John M. Talbot
2015	J	`jnl`	An Exact Turán Result for Tripartite 3-Graphs. Electron. J. Comb. Adam Sanitt, John M. Talbot
2014	J	`jnl`	A Solution to the 2/3 Conjecture. SIAM J. Discret. Math. Rahil Baber, John M. Talbot
2012	J	`jnl`	New Turán Densities for 3-Graphs. Electron. J. Comb. Rahil Baber, John M. Talbot
2012	J	`jnl`	Vertex Ramsey Problems in the Hypercube. SIAM J. Discret. Math. John L. Goldwasser, John M. Talbot
2011	J	`jnl`	Hypergraphs Do Jump. Comb. Probab. Comput. Rahil Baber, John M. Talbot
2010	J	`jnl`	The minimal density of triangles in tripartite graphs. LMS J. Comput. Math. Rahil Baber, J. Robert Johnson, John M. Talbot
2010	J	`jnl`	Vertex Turán problems in the hypercube. J. Comb. Theory A J. Robert Johnson, John M. Talbot
2008	—	`conf`	Bloom Maps. ANALCO David Talbot, John M. Talbot
2008	J	`jnl`	Extremal Problems for t-Partite and t-Colorable Hypergraphs. Electron. J. Comb. Dhruv Mubayi, John M. Talbot
2007	J	`jnl`	A note on the jumping constant conjecture of Erdös. J. Comb. Theory B Peter Frankl, Yuejian Peng, Vojtech Rödl, John M. Talbot
2007	J	`jnl`	Bloom maps CoRR David Talbot, John M. Talbot
2007	J	`jnl`	Chromatic Turán problems and a new upper bound for the Turán density of Ks Eur. J. Comb. John M. Talbot
2006	—	`book`	Complexity and cryptography - an introduction. John M. Talbot, Dominic J. A. Welsh
2005	J	`jnl`	Compression and Erdös-Ko-Rado graphs. Discret. Math. Fred C. Holroyd, Claire Spencer, John M. Talbot
2005	J	`jnl`	Graphs with the Erdös-Ko-Rado property. Discret. Math. Fred C. Holroyd, John M. Talbot
2005	J	`jnl`	The Intersection Structure of t-Intersecting Families. Electron. J. Comb. John M. Talbot
2004	J	`jnl`	A new Bollobás-type inequality and applications to t-intersecting families of sets. Discret. Math. John M. Talbot
2004	J	`jnl`	Counting consistent phylogenetic trees is #P-complete. Adv. Appl. Math. Magnus Bordewich, Charles Semple, John M. Talbot
2004	J	`jnl`	The number of k-intersections of an intersecting family of r-sets. J. Comb. Theory A John M. Talbot
2002	J	`jnl`	Lagrangians Of Hypergraphs. Comb. Probab. Comput. John M. Talbot