dblp.uni-trier.dewww.uni-trier.de

Peter Keevash

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
21EEPeter Keevash: A hypergraph regularity method for generalized Turán problems. Random Struct. Algorithms 34(1): 123-164 (2009)
2007
20EEPeter Keevash, Dhruv Mubayi, Benny Sudakov, Jacques Verstraëte: Rainbow Turán Problems. Combinatorics, Probability & Computing 16(1): 109-126 (2007)
19EEPeter Keevash, Yi Zhao: Codegree problems for projective geometries. J. Comb. Theory, Ser. B 97(6): 919-928 (2007)
2006
18EEPeter Keevash, Cheng Yeaw Ku: A random construction for permutation codes and the covering radius. Des. Codes Cryptography 41(1): 79-86 (2006)
17EEPeter Keevash, Po-Shen Loh, Benny Sudakov: Bounding the Number of Edges in Permutation Graphs. Electr. J. Comb. 13(1): (2006)
16EERichard P. Anstee, Peter Keevash: Pairwise intersections and forbidden configurations. Eur. J. Comb. 27(8): 1235-1248 (2006)
15EEPeter Keevash, Benny Sudakov: On a restricted cross-intersection problem. J. Comb. Theory, Ser. A 113(7): 1536-1542 (2006)
14EEPeter Keevash, Benny Sudakov: Sparse halves in triangle-free graphs. J. Comb. Theory, Ser. B 96(4): 614-620 (2006)
13EEJó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)
12EEPeter Keevash, Dhruv Mubayi, Richard M. Wilson: Set Systems with No Singleton Intersection. SIAM J. Discrete Math. 20(4): 1031-1041 (2006)
2005
11EEPeter Keevash, Benny Sudakov: The Turán Number Of The Fano Plane. Combinatorica 25(5): 561-574 (2005)
10EEPeter Keevash, Benny Sudakov: On A Hypergraph Turán Problem Of Frankl. Combinatorica 25(6): 673-706 (2005)
9EEPeter Keevash: The Turán Problem for Hypergraphs of Fixed Size. Electr. J. Comb. 12: (2005)
8EEPeter Keevash: The Turán problem for projective geometries. J. Comb. Theory, Ser. A 111(2): 289-309 (2005)
7EEJózsef Balogh, Peter Keevash, Benny Sudakov: Disjoint representability of sets and their complements. J. Comb. Theory, Ser. B 95(1): 12-28 (2005)
6EEPeter 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
5EEBéla Bollobás, Peter Keevash, Benny Sudakov: Multicoloured extremal problems. J. Comb. Theory, Ser. A 107(2): 295-312 (2004)
4EEPeter 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)
3EEPeter Keevash, Dhruv Mubayi: Stability theorems for cancellative hypergraphs. J. Comb. Theory, Ser. B 92(1): 163-175 (2004)
2EEPeter Keevash, Benny Sudakov: Packing triangles in a graph and its complement. Journal of Graph Theory 47(3): 203-216 (2004)
2003
1 Peter Keevash, Benny Sudakov: Local Density In Graphs With Forbidden Subgraphs. Combinatorics, Probability & Computing 12(2): (2003)

Coauthor Index

1Richard P. Anstee [16]
2József Balogh [7] [13]
3Béla Bollobás [5]
4Cheng Yeaw Ku [18]
5Po-Shen Loh [17]
6Dhruv Mubayi [3] [12] [20]
7Benny Sudakov [1] [2] [4] [5] [6] [7] [10] [11] [13] [14] [15] [17] [20]
8Jacques Verstraëte [20]
9Richard M. Wilson [12]
10Yi Zhao [19]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)