| 2008 |
|---|
| 10 | EE | J. Robert Johnson,
John M. Talbot:
G-Intersection Theorems for Matchings and Other Graphs.
Combinatorics, Probability & Computing 17(4): 559-575 (2008) |
| 2007 |
|---|
| 9 | EE | David Talbot,
John M. Talbot:
Bloom maps
CoRR abs/0710.3246: (2007) |
| 8 | EE | 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) |
| 7 | EE | Peter Frankl,
Yuejian Peng,
Vojtech Rödl,
John M. Talbot:
A note on the jumping constant conjecture of Erdös.
J. Comb. Theory, Ser. B 97(2): 204-216 (2007) |
| 2005 |
|---|
| 6 | EE | Fred C. Holroyd,
Claire Spencer,
John M. Talbot:
Compression and Erdo"s-Ko-Rado graphs.
Discrete Mathematics 293(1-3): 155-164 (2005) |
| 5 | EE | Fred C. Holroyd,
John M. Talbot:
Graphs with the Erdös-Ko-Rado property.
Discrete Mathematics 293(1-3): 165-176 (2005) |
| 4 | EE | John M. Talbot:
The Intersection Structure of t-Intersecting Families.
Electr. J. Comb. 12: (2005) |
| 2004 |
|---|
| 3 | EE | John M. Talbot:
A new Bollobás-type inequality and applications to t-intersecting families of sets.
Discrete Mathematics 285(1-3): 349-353 (2004) |
| 2 | EE | John M. Talbot:
The number of k-intersections of an intersecting family of r-sets.
J. Comb. Theory, Ser. A 106(2): 277-286 (2004) |
| 2002 |
|---|
| 1 | | John M. Talbot:
Lagrangians Of Hypergraphs.
Combinatorics, Probability & Computing 11(2): (2002) |
