|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
No Growbag Graphs found.
|
|
|
|
|
Results
Found 7 publication records. Showing 7 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Peter Allen, Julia Böttcher, Jan Hladký, Oliver Cooley |
Minimum degree conditions for large subgraphs.  |
Electronic Notes in Discrete Mathematics  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Oliver Cooley, Jan Hladký, Diana Piguet |
Loebl-Komlós-Sós Conjecture: dense case. |
Electronic Notes in Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Oliver Cooley |
Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Oliver Cooley, Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus |
Embeddings and Ramsey numbers of sparse kappa-uniform hypergraphs. |
Combinatorica |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Oliver Cooley, Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus |
3-Uniform hypergraphs of bounded degree have linear Ramsey numbers. |
J. Comb. Theory, Ser. B |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniela Kühn, Oliver Cooley, Nikolaos Fountoulakis, Deryk Osthus |
Ramsey numbers of sparse hypergraphs. |
Electronic Notes in Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Oliver Cooley, Daniela Kühn, Deryk Osthus |
Perfect packings with complete graphs minus an edge. |
Eur. J. Comb. |
2007 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #7 of 7 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")