CaltechAUTHORS
  A Caltech Library Service

Items where Person is "Keevash-P"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Date | Item Type | First Author | No Grouping
Jump to: 2007 | 2006 | 2005
Number of items: 6.

2007

Keevash, Peter and Mubayi, Dhruv and Sudakov, Benny et al. (2007) Rainbow Turán Problems. Combinatorics, Probability, and Computing, 16 (1). pp. 109-126. ISSN 0963-5483. https://resolver.caltech.edu/CaltechAUTHORS:KEEcpc07

2006

Keevash, Peter and Mubayi, Dhruv and Wilson, Richard M. (2006) Set Systems with No Singleton Intersection. SIAM Journal on Discrete Mathematics, 20 (4). pp. 1031-1041. ISSN 0895-4801. https://resolver.caltech.edu/CaltechAUTHORS:KEEsiamjd06

Keevash, Peter and Ku, Cheng Yeaw (2006) A random construction for permutation codes and the covering radius. Designs, Codes and Cryptography, 41 (1). pp. 79-86. ISSN 0925-1022. https://resolver.caltech.edu/CaltechAUTHORS:20200318-100513825

Keevash, Peter and Loh, Po-Shen and Sudakov, Benny (2006) Bounding the Number of Edges in Permutation Graphs. Electronic Journal of Combinatorics, 13 (1). R44. ISSN 1077-8926. https://resolver.caltech.edu/CaltechAUTHORS:KEEejc06

2005

Keevash, Peter (2005) The Turán problem for hypergraphs of fixed size. Electronic Journal of Combinatorics, 12 (1). N11. ISSN 1077-8926. https://resolver.caltech.edu/CaltechAUTHORS:KEEejc05

Kevash, Peter and Sudakov, Benny (2005) Set Systems with Restricted Cross-Intersections and the Minimum Rank of Inclusion Matrices. SIAM Journal on Discrete Mathematics, 18 (4). pp. 713-727. ISSN 0895-4801. https://resolver.caltech.edu/CaltechAUTHORS:KEEsiamjdm05

This list was generated on Sun Aug 9 16:31:52 2020 PDT.