|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 3 occurrences of 3 keywords
|
|
|
|
|
Results
Found 30 publication records. Showing 30 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Peter Keevash, Daniela Kühn, Richard Mycroft, Deryk Osthus |
Loose Hamilton cycles in hypergraphs.  |
Discrete Mathematics  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Keevash |
A hypergraph blow-up lemma. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Bill Jackson, Peter Keevash |
Necessary Conditions for the Global Rigidity of Direction-Length Frameworks. |
Discrete & Computational Geometry |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Bill Jackson, Peter Keevash |
Bounded Direction-Length Frameworks. |
Discrete & Computational Geometry |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Keevash, Benny Sudakov |
Pancyclicity of Hamiltonian and highly connected graphs. |
J. Comb. Theory, Ser. B |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jacob Fox, Peter Keevash, Benny Sudakov |
Directed Graphs Without Short Cycles. |
Combinatorics, Probability & Computing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Keevash, Dhruv Mubayi |
Set systems without a simplex or a cluster. |
Combinatorica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Demetres Christofides, Peter Keevash, Daniela Kühn, Deryk Osthus |
A Semiexact Degree Condition for Hamilton Cycles in Digraphs. |
SIAM J. Discrete Math. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Keevash, Benny Sudakov |
Triangle packings and 1-factors in oriented graphs. |
J. Comb. Theory, Ser. B |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Keevash |
A hypergraph regularity method for generalized Turán problems. |
Random Struct. Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Keevash, Yi Zhao |
Codegree problems for projective geometries. |
J. Comb. Theory, Ser. B |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Keevash, Dhruv Mubayi, Benny Sudakov, Jacques Verstraëte |
Rainbow Turán Problems. |
Combinatorics, Probability & Computing |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Keevash, Benny Sudakov |
On a restricted cross-intersection problem. |
J. Comb. Theory, Ser. A |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Keevash, Benny Sudakov |
Sparse halves in triangle-free graphs. |
J. Comb. Theory, Ser. B |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard P. Anstee, Peter Keevash |
Pairwise intersections and forbidden configurations. |
Eur. J. Comb. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Keevash, Po-Shen Loh, Benny Sudakov |
Bounding the Number of Edges in Permutation Graphs. |
Electr. J. Comb. |
2006 |
DBLP BibTeX RDF |
|
| 1 | Peter Keevash, Dhruv Mubayi, Richard M. Wilson |
Set Systems with No Singleton Intersection. |
SIAM J. Discrete Math. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Keevash, Cheng Yeaw Ku |
A random construction for permutation codes and the covering radius. |
Des. Codes Cryptography |
2006 |
DBLP DOI BibTeX RDF |
AMS Classification 05D40 |
| 1 | József Balogh, Peter Keevash, Benny Sudakov |
Disjoint representability of sets and their complements. |
J. Comb. Theory, Ser. B |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Keevash |
The Turán problem for projective geometries. |
J. Comb. Theory, Ser. A |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Keevash |
The Turán Problem for Hypergraphs of Fixed Size. |
Electr. J. Comb. |
2005 |
DBLP BibTeX RDF |
|
| 1 | Peter Keevash, Benny Sudakov |
The Turán Number Of The Fano Plane. |
Combinatorica |
2005 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C65, 05C35 |
| 1 | Peter Keevash, Benny Sudakov |
On A Hypergraph Turán Problem Of Frankl. |
Combinatorica |
2005 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C35, 05E35, 05D05, 05C65 |
| 1 | Peter Keevash, Benny Sudakov |
Set Systems with Restricted Cross-Intersections and the Minimum Rank of Inclusion Matrices. |
SIAM J. Discrete Math. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Keevash, Dhruv Mubayi |
Stability theorems for cancellative hypergraphs. |
J. Comb. Theory, Ser. B |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Keevash, Benny Sudakov |
On the number of edges not covered by monochromatic copies of a fixed graph. |
J. Comb. Theory, Ser. B |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Béla Bollobás, Peter Keevash, Benny Sudakov |
Multicoloured extremal problems. |
J. Comb. Theory, Ser. A |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Keevash, Benny Sudakov |
Packing triangles in a graph and its complement. |
Journal of Graph Theory |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Keevash, Benny Sudakov |
Local Density In Graphs With Forbidden Subgraphs. |
Combinatorics, Probability & Computing |
2003 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #30 of 30 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")