hosted by
publicationslist.org
 
John
Talbot
UCL
john.talbot@gmail.com
Books
2007
Anthony Hilton
,
John Talbot
(2007)
Surveys
in
combinatorics
2007
Cambridge:
Cambridge University Press
346:
Abstract:
Notes: Papers from the 21st Biennial British Combinatorial Conference held in Reading, July 2007
2006
John Talbot
,
Dominic Welsh
(2006)
Complexity
and
cryptography
Cambridge:
Cambridge University Press
Abstract:
Notes: An introduction
Journal articles
2008
J Robert Johnson
,
John Talbot
(2008)
$G$-intersection
theorems
for
matchings
and
other
graphs
Combin. Probab. Comput.
17:
4.
559-575
Abstract:
Notes:
Dhruv Mubayi
,
John Talbot
(2008)
Extremal
problems
for
$t$-partite
and
$t$-colorable
hypergraphs
Electron. J. Combin.
15:
1.
Abstract:
Notes:
2007
Peter Frankl
,
Yuejian Peng
,
Vojtech Rödl
,
John Talbot
(2007)
A
note
on
the
jumping
constant
conjecture
of
Erd\H
os
J. Combin. Theory Ser. B
97:
2.
204-216
Abstract:
Notes:
John Talbot
(2007)
Chromatic
Turán
problems
and
a
new
upper
bound
for
the
Turán
density
of
$\scr
K\sb
4\sp
-$
European J. Combin.
28:
8.
2125-2142
Abstract:
Notes:
2005
Fred Holroyd
,
Claire Spencer
,
John Talbot
(2005)
Compression
and
Erd\H
os-Ko-Rado
graphs
Discrete Math.
293:
1-3.
155-164
Abstract:
Notes:
Fred Holroyd
,
John Talbot
(2005)
Graphs
with
the
Erd\H
os-Ko-Rado
property
Discrete Math.
293:
1-3.
165-176
Abstract:
Notes:
John Talbot
(2005)
The
intersection
structure
of
$t$-intersecting
families
Electron. J. Combin.
12:
Abstract:
Notes:
2004
John Talbot
(2004)
The
number
of
$k$-intersections
of
an
intersecting
family
of
$r$-sets
J. Combin. Theory Ser. A
106:
2.
277-286
Abstract:
Notes:
Magnus Bordewich
,
Charles Semple
,
John Talbot
(2004)
Counting
consistent
phylogenetic
trees
is
$#\rm
P$-complete
Adv. in Appl. Math.
33:
2.
416-430
Abstract:
Notes:
John Talbot
(2004)
A
new
Bollobás-type
inequality
and
applications
to
$t$-intersecting
families
of
sets
Discrete Math.
285:
1-3.
349-353
Abstract:
Notes:
2003
John Talbot
(2003)
Intersecting
families
of
separated
sets
J. London Math. Soc. (2)
68:
1.
37-51
Abstract:
Notes:
2002
John Talbot
(2002)
Lagrangians
of
hypergraphs
Combin. Probab. Comput.
11:
2.
199-216
Abstract:
Notes:
select all
|
select none
Selected
:
Delete selected items
Export selected items to:
bibtex
|
endnote
|
Procite (RIS)
|
Mods XML
Powered by
publicationslist.org
.