The SCEAS System
Navigation Menu

Search the dblp DataBase


John M. Talbot: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. John M. Talbot
    Lagrangians Of Hypergraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2002, v:11, n:2, pp:- [Journal]
  2. Fred C. Holroyd, Claire Spencer, John M. Talbot
    Compression and Erdo"s-Ko-Rado graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:293, n:1-3, pp:155-164 [Journal]
  3. Fred C. Holroyd, John M. Talbot
    Graphs with the Erdös-Ko-Rado property. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:293, n:1-3, pp:165-176 [Journal]
  4. John M. Talbot
    A new Bollobás-type inequality and applications to t-intersecting families of sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:349-353 [Journal]
  5. John M. Talbot
    The number of k-intersections of an intersecting family of r-sets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2004, v:106, n:2, pp:277-286 [Journal]
  6. Peter Frankl, Yuejian Peng, Vojtech Rödl, John M. Talbot
    A note on the jumping constant conjecture of Erdös. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2007, v:97, n:2, pp:204-216 [Journal]
  7. David Talbot, John M. Talbot
    Bloom maps [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  8. The Intersection Structure of t-Intersecting Families. [Citation Graph (, )][DBLP]

  9. G-Intersection Theorems for Matchings and Other Graphs. [Citation Graph (, )][DBLP]

  10. Chromatic Turán problems and a new upper bound for the Turán density of Ks-4. [Citation Graph (, )][DBLP]

Search in 0.001secs, Finished in 0.002secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002