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

Peter Keevash Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2011
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBill Jackson, Peter Keevash: Bounded Direction-Length Frameworks. Discrete & Computational Geometry 46(1): 48-71 (2011)
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBill Jackson, Peter Keevash: Necessary Conditions for the Global Rigidity of Direction-Length Frameworks. Discrete & Computational Geometry 46(1): 72-85 (2011)
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Keevash, Daniela Kühn, Richard Mycroft, Deryk Osthus: Loose Hamilton cycles in hypergraphs. Discrete Mathematics 311(7): 544-559 (2011)
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Keevash: A hypergraph blow-up lemma. Random Struct. Algorithms 39(3): 275-376 (2011)
2010
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Keevash, Dhruv Mubayi: Set systems without a simplex or a cluster. Combinatorica 30(2): 175-200 (2010)
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJacob Fox, Peter Keevash, Benny Sudakov: Directed Graphs Without Short Cycles. Combinatorics, Probability & Computing 19(2): 285-301 (2010)
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Keevash, Benny Sudakov: Pancyclicity of Hamiltonian and highly connected graphs. J. Comb. Theory, Ser. B 100(5): 456-467 (2010)
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDemetres 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
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Keevash, Benny Sudakov: Triangle packings and 1-factors in oriented graphs. J. Comb. Theory, Ser. B 99(4): 709-727 (2009)
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Keevash: A hypergraph regularity method for generalized Turán problems. Random Struct. Algorithms 34(1): 123-164 (2009)
2007
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Keevash, Dhruv Mubayi, Benny Sudakov, Jacques Verstraëte: Rainbow Turán Problems. Combinatorics, Probability & Computing 16(1): 109-126 (2007)
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Keevash, Yi Zhao: Codegree problems for projective geometries. J. Comb. Theory, Ser. B 97(6): 919-928 (2007)
2006
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Keevash, Cheng Yeaw Ku: A random construction for permutation codes and the covering radius. Des. Codes Cryptography 41(1): 79-86 (2006)
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Keevash, Po-Shen Loh, Benny Sudakov: Bounding the Number of Edges in Permutation Graphs. Electr. J. Comb. 13(1): (2006)
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRichard P. Anstee, Peter Keevash: Pairwise intersections and forbidden configurations. Eur. J. Comb. 27(8): 1235-1248 (2006)
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Keevash, Benny Sudakov: On a restricted cross-intersection problem. J. Comb. Theory, Ser. A 113(7): 1536-1542 (2006)
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Keevash, Benny Sudakov: Sparse halves in triangle-free graphs. J. Comb. Theory, Ser. B 96(4): 614-620 (2006)
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJó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)
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Keevash, Dhruv Mubayi, Richard M. Wilson: Set Systems with No Singleton Intersection. SIAM J. Discrete Math. 20(4): 1031-1041 (2006)
2005
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Keevash, Benny Sudakov: The Turán Number Of The Fano Plane. Combinatorica 25(5): 561-574 (2005)
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Keevash, Benny Sudakov: On A Hypergraph Turán Problem Of Frankl. Combinatorica 25(6): 673-706 (2005)
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Keevash: The Turán Problem for Hypergraphs of Fixed Size. Electr. J. Comb. 12: (2005)
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Keevash: The Turán problem for projective geometries. J. Comb. Theory, Ser. A 111(2): 289-309 (2005)
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJózsef Balogh, Peter Keevash, Benny Sudakov: Disjoint representability of sets and their complements. J. Comb. Theory, Ser. B 95(1): 12-28 (2005)
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter 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
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBéla Bollobás, Peter Keevash, Benny Sudakov: Multicoloured extremal problems. J. Comb. Theory, Ser. A 107(2): 295-312 (2004)
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter 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)
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Keevash, Dhruv Mubayi: Stability theorems for cancellative hypergraphs. J. Comb. Theory, Ser. B 92(1): 163-175 (2004)
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Keevash, Benny Sudakov: Packing triangles in a graph and its complement. Journal of Graph Theory 47(3): 203-216 (2004)
2003
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Keevash, Benny Sudakov: Local Density In Graphs With Forbidden Subgraphs. Combinatorics, Probability & Computing 12(2): 139-153 (2003)

Coauthor Index

1Richard P. Anstee [16]
2József Balogh [7] [13]
3Béla Bollobás [5]
4Demetres Christofides [23]
5Jacob Fox [25]
6Bill Jackson [29] [30]
7Cheng Yeaw Ku [18]
8Daniela Kühn [23] [28]
9Po-Shen Loh [17]
10Dhruv Mubayi [3] [12] [20] [26]
11Richard Mycroft [28]
12Deryk Osthus [23] [28]
13Benny Sudakov [1] [2] [4] [5] [6] [7] [10] [11] [13] [14] [15] [17] [20] [22] [24] [25]
14Jacques Verstraëte [20]
15Richard M. Wilson [12]
16Yi Zhao [19]

Colors in the list of coauthors

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page