Bibsonomy :: author  ::

bookmarks

publications

(20)

• Set Systems with No Singleton Intersection.
  Peter Keevash and Dhruv Mubayi and Richard M. Wilson SIAM J. Discrete Math. 20 1031-1041 (2006)
  to dblp by dblp on 2008-06-20 00:00:00
  | URL | BibTeX  
• Bounding the Number of Edges in Permutation Graphs.
  Peter Keevash and Po-Shen Loh and Benny Sudakov Electr. J. Comb. 13 (2006)
  to dblp by dblp on 2008-05-25 00:00:00
  | URL | BibTeX  
• The Turán Problem for Hypergraphs of Fixed Size.
  Peter Keevash Electr. J. Comb. 12 (2005)
  to dblp by dblp on 2008-05-25 00:00:00
  | URL | BibTeX  
• The characteristic polynomial of a random permutation matrix
  B. M. Hambly and P. Keevash and N. O'Connell and D. Stark Stochastic Processes and their Applications 90 335--346 (2000)
  to Feller coupling by smicha on 2008-04-22 14:25:45
  | URL | BibTeX  
• Codegree problems for projective geometries.
  Peter Keevash and Yi Zhao J. Comb. Theory, Ser. B 97 919-928 (2007)
  to dblp by dblp on 2007-09-20 00:00:00
  | URL | BibTeX  
• Packing triangles in a graph and its complement.
  Peter Keevash and Benny Sudakov Journal of Graph Theory 47 203-216 (2004)
  to dblp by dblp on 2007-04-30 00:00:00
  | URL | BibTeX  
• Sparse halves in triangle-free graphs.
  Peter Keevash and Benny Sudakov J. Comb. Theory, Ser. B 96 614-620 (2006)
  to dblp by dblp on 2007-03-26 00:00:00
  | URL | BibTeX  
• On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs.
  József Balogh and Peter Keevash and Benny Sudakov J. Comb. Theory, Ser. B 96 919-932 (2006)
  to dblp by dblp on 2007-03-26 00:00:00
  | URL | BibTeX  
• A random construction for permutation codes and the covering radius.
  Peter Keevash and Cheng Yeaw Ku Des. Codes Cryptography 41 79-86 (2006)
  to dblp by dblp on 2007-02-08 00:00:00
  | URL | BibTeX  
• On a restricted cross-intersection problem.
  Peter Keevash and Benny Sudakov J. Comb. Theory, Ser. A 113 1536-1542 (2006)
  to dblp by dblp on 2007-01-23 00:00:00
  | URL | BibTeX