- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j32 |      | Peter Keevash, Dhruv Mubayi: The Turán Number of F3, 3. Combinatorics, Probability & Computing 21(3): 451-456 (2012) |
| j31 | | Demetres Christofides, Peter Keevash, Daniela Kühn, Deryk Osthus: Finding Hamilton cycles in robustly expanding digraphs. J. Graph Algorithms Appl. 16(2): 335-358 (2012) |
| 2011 | ||
| j30 | | Bill Jackson, Peter Keevash: Bounded Direction-Length Frameworks. Discrete & Computational Geometry 46(1): 48-71 (2011) |
| j29 | | Bill Jackson, Peter Keevash: Necessary Conditions for the Global Rigidity of Direction-Length Frameworks. Discrete & Computational Geometry 46(1): 72-85 (2011) |
| j28 | | Peter Keevash, Daniela Kühn, Richard Mycroft, Deryk Osthus: Loose Hamilton cycles in hypergraphs. Discrete Mathematics 311(7): 544-559 (2011) |
| j27 | | |
| 2010 | ||
| j26 | | Peter Keevash, Dhruv Mubayi: Set systems without a simplex or a cluster. Combinatorica 30(2): 175-200 (2010) |
| j25 | | Jacob Fox, Peter Keevash, Benny Sudakov: Directed Graphs Without Short Cycles. Combinatorics, Probability & Computing 19(2): 285-301 (2010) |
| j24 | | Peter Keevash, Benny Sudakov: Pancyclicity of Hamiltonian and highly connected graphs. J. Comb. Theory, Ser. B 100(5): 456-467 (2010) |
| j23 | | Demetres Christofides, Peter Keevash, Daniela Kühn, Deryk Osthus: A Semiexact Degree Condition for Hamilton Cycles in Digraphs. SIAM J. Discrete Math. 24(3): 709-756 (2010) |
| 2009 | ||
| j22 | | Peter Keevash, Benny Sudakov: Triangle packings and 1-factors in oriented graphs. J. Comb. Theory, Ser. B 99(4): 709-727 (2009) |
| j21 | | Peter Keevash: A hypergraph regularity method for generalized Turán problems. Random Struct. Algorithms 34(1): 123-164 (2009) |
| 2007 | ||
| j20 | | Peter Keevash, Dhruv Mubayi, Benny Sudakov, Jacques Verstraëte: Rainbow Turán Problems. Combinatorics, Probability & Computing 16(1): 109-126 (2007) |
| j19 | | Peter Keevash, Yi Zhao: Codegree problems for projective geometries. J. Comb. Theory, Ser. B 97(6): 919-928 (2007) |
| 2006 | ||
| j18 | | Peter Keevash, Po-Shen Loh, Benny Sudakov: Bounding the Number of Edges in Permutation Graphs. Electr. J. Comb. 13(1) (2006) |
| j17 | | Peter Keevash, Cheng Yeaw Ku: A random construction for permutation codes and the covering radius. Des. Codes Cryptography 41(1): 79-86 (2006) |
| j16 | | Richard P. Anstee, Peter Keevash: Pairwise intersections and forbidden configurations. Eur. J. Comb. 27(8): 1235-1248 (2006) |
| j15 | | Peter Keevash, Benny Sudakov: Sparse halves in triangle-free graphs. J. Comb. Theory, Ser. B 96(4): 614-620 (2006) |
| j14 | | József Balogh, Peter Keevash, Benny Sudakov: On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs. J. Comb. Theory, Ser. B 96(6): 919-932 (2006) |
| j13 | | Peter Keevash, Benny Sudakov: On a restricted cross-intersection problem. J. Comb. Theory, Ser. A 113(7): 1536-1542 (2006) |
| j12 | | Peter Keevash, Dhruv Mubayi, Richard M. Wilson: Set Systems with No Singleton Intersection. SIAM J. Discrete Math. 20(4): 1031-1041 (2006) |
| 2005 | ||
| j11 | | Peter Keevash, Benny Sudakov: The Turán Number Of The Fano Plane. Combinatorica 25(5): 561-574 (2005) |
| j10 | | Peter Keevash, Benny Sudakov: On A Hypergraph Turán Problem Of Frankl. Combinatorica 25(6): 673-706 (2005) |
| j9 | | |
| j8 | | József Balogh, Peter Keevash, Benny Sudakov: Disjoint representability of sets and their complements. J. Comb. Theory, Ser. B 95(1): 12-28 (2005) |
| j7 | | Peter Keevash: The Turán problem for projective geometries. J. Comb. Theory, Ser. A 111(2): 289-309 (2005) |
| j6 | | Peter Keevash, Benny Sudakov: Set Systems with Restricted Cross-Intersections and the Minimum Rank of Inclusion Matrices. SIAM J. Discrete Math. 18(4): 713-727 (2005) |
| 2004 | ||
| j5 | | Peter Keevash, Benny Sudakov: On the number of edges not covered by monochromatic copies of a fixed graph. J. Comb. Theory, Ser. B 90(1): 41-53 (2004) |
| j4 | | Peter Keevash, Dhruv Mubayi: Stability theorems for cancellative hypergraphs. J. Comb. Theory, Ser. B 92(1): 163-175 (2004) |
| j3 | | Béla Bollobás, Peter Keevash, Benny Sudakov: Multicoloured extremal problems. J. Comb. Theory, Ser. A 107(2): 295-312 (2004) |
| j2 | | Peter Keevash, Benny Sudakov: Packing triangles in a graph and its complement. Journal of Graph Theory 47(3): 203-216 (2004) |
| 2003 | ||
| j1 | | Peter Keevash, Benny Sudakov: Local Density In Graphs With Forbidden Subgraphs. Combinatorics, Probability & Computing 12(2): 139-153 (2003) |
Colors in the list of coauthors
Last update Sun May 19 01:08:34 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page