The SCEAS System
| |||||||

## Search the dblp DataBase
Peter Keevash:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Peter Keevash, Benny Sudakov
**The Turán Number Of The Fano Plane.**[Citation Graph (0, 0)][DBLP] Combinatorica, 2005, v:25, n:5, pp:561-574 [Journal] - Peter Keevash, Benny Sudakov
**On A Hypergraph Turán Problem Of Frankl.**[Citation Graph (0, 0)][DBLP] Combinatorica, 2005, v:25, n:6, pp:673-706 [Journal] - Peter Keevash, Benny Sudakov
**Local Density In Graphs With Forbidden Subgraphs.**[Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 2003, v:12, n:2, pp:- [Journal] - Peter Keevash, Cheng Yeaw Ku
**A random construction for permutation codes and the covering radius.**[Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 2006, v:41, n:1, pp:79-86 [Journal] - Richard P. Anstee, Peter Keevash
**Pairwise intersections and forbidden configurations.**[Citation Graph (0, 0)][DBLP] Eur. J. Comb., 2006, v:27, n:8, pp:1235-1248 [Journal] - József Balogh, Peter Keevash, Benny Sudakov
**Disjoint representability of sets and their complements.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2005, v:95, n:1, pp:12-28 [Journal] - Béla Bollobás, Peter Keevash, Benny Sudakov
**Multicoloured extremal problems.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 2004, v:107, n:2, pp:295-312 [Journal] - Peter Keevash
**The Turán problem for projective geometries.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 2005, v:111, n:2, pp:289-309 [Journal] - Peter Keevash, Dhruv Mubayi
**Stability theorems for cancellative hypergraphs.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2004, v:92, n:1, pp:163-175 [Journal] - Peter Keevash, Benny Sudakov
**On the number of edges not covered by monochromatic copies of a fixed graph.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2004, v:90, n:1, pp:41-53 [Journal] - Peter Keevash, Benny Sudakov
**On a restricted cross-intersection problem.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 2006, v:113, n:7, pp:1536-1542 [Journal] - József Balogh, Peter Keevash, Benny Sudakov
**On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2006, v:96, n:6, pp:919-932 [Journal] - Peter Keevash, Benny Sudakov
**Sparse halves in triangle-free graphs.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2006, v:96, n:4, pp:614-620 [Journal] - Peter Keevash, Benny Sudakov
**Set Systems with Restricted Cross-Intersections and the Minimum Rank of Inclusion Matrices.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2005, v:18, n:4, pp:713-727 [Journal] - Peter Keevash, Benny Sudakov
**Packing triangles in a graph and its complement.**[Citation Graph (0, 0)][DBLP] Journal of Graph Theory, 2004, v:47, n:3, pp:203-216 [Journal] - Peter Keevash, Yi Zhao
**Codegree problems for projective geometries.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2007, v:97, n:6, pp:919-928 [Journal] **The Turán Problem for Hypergraphs of Fixed Size.**[Citation Graph (, )][DBLP]**Bounding the Number of Edges in Permutation Graphs.**[Citation Graph (, )][DBLP]**Rainbow Turán Problems.**[Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.005secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |