default search action
Oliver Cooley
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j28]Oliver Cooley
, Nicola Del Giudice, Mihyun Kang
Phase Transition in Cohomology Groups of Non-Uniform Random Simplicial Complexes. Electron. J. Comb. 29(3) (2022) - [j27]Oliver Cooley
Loose Cores and Cycles in Random Hypergraphs. Electron. J. Comb. 29(4) (2022) - [c4]Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Joon Lee, Jean Bernoulli Ravelomanana:
The Sparse Parity Matrix. SODA 2022: 822-833 - 2021
- [j26]Oliver Cooley
Large Induced Matchings in Random Graphs. SIAM J. Discret. Math. 35(1): 267-280 (2021) - [j25]Oliver Cooley
Longest Paths in Random Hypergraphs. SIAM J. Discret. Math. 35(4): 2430-2458 (2021) - 2020
- [j24]Oliver Cooley
Vanishing of cohomology groups of random simplicial complexes. Random Struct. Algorithms 56(2): 461-500 (2020) - [j23]Oliver Cooley, Wenjie Fang, Nicola Del Giudice, Mihyun Kang
Subcritical Random Hypergraphs, High-Order Components, and Hypertrees. SIAM J. Discret. Math. 34(4): 2033-2062 (2020)
2010 – 2019
- 2019
- [j22]Oliver Cooley, Mihyun Kang, Christoph Koch:
The Size of the Giant Component in Random Hypergraphs: a Short Proof. Electron. J. Comb. 26(3): 3 (2019) - [j21]Amin Coja-Oghlan, Oliver Cooley
Core forging and local limit theorems for the k-core of random graphs. J. Comb. Theory B 137: 178-231 (2019) - [c3]Oliver Cooley
Subcritical random hypergraphs, high-order components, and hypertrees. ANALCO 2019: 111-118 - 2018
- [j20]Oliver Cooley
Largest Components in Random Hypergraphs. Comb. Probab. Comput. 27(5): 741-762 (2018) - [j19]Oliver Cooley
The size of the giant high-order component in random hypergraphs. Random Struct. Algorithms 53(2): 238-288 (2018) - [c2]Oliver Cooley
Vanishing of Cohomology Groups of Random Simplicial Complexes (Keynote Speakers). AofA 2018: 7:1-7:14 - 2017
- [j18]Oliver Cooley
The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph. Discret. Math. 340(6): 1172-1179 (2017) - [j17]Oliver Cooley
Homological connectedness of random hypergraphs. Electron. Notes Discret. Math. 61: 279-285 (2017) - [j16]Béla Bollobás, Oliver Cooley
Jigsaw percolation on random hypergraphs. J. Appl. Probab. 54(4): 1261-1277 (2017) - [j15]Peter Allen, Julia Böttcher
Tight cycles and regular slices in dense hypergraphs. J. Comb. Theory A 149: 30-100 (2017) - [j14]Amin Coja-Oghlan, Oliver Cooley
How does the core sit inside the mantle? Random Struct. Algorithms 51(3): 459-482 (2017) - [j13]Amin Coja-Oghlan, Oliver Cooley
The Minimum Bisection in the Planted Bisection Model. Theory Comput. 13(1): 1-22 (2017) - [i3]Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch:
Core forging and local limit theorems for the k-core of random graphs. CoRR abs/1707.03556 (2017) - 2016
- [j12]Oliver Cooley
Threshold and Hitting Time for High-Order Connectedness in Random Hypergraphs. Electron. J. Comb. 23(2): 2 (2016) - 2015
- [j11]Amin Coja-Oghlan, Oliver Cooley
How does the core sit inside the mantle? Electron. Notes Discret. Math. 49: 489-496 (2015) - [j10]Oliver Cooley
Evolution of high-order connected components in random hypergraphs. Electron. Notes Discret. Math. 49: 569-575 (2015) - [j9]Peter Allen, Julia Böttcher
Tight Cycles in Hypergraphs. Electron. Notes Discret. Math. 49: 675-682 (2015) - [j8]Peter Allen, Julia Böttcher
Regular slices for hypergraphs. Electron. Notes Discret. Math. 49: 691-698 (2015) - [c1]Amin Coja-Oghlan, Oliver Cooley
The Minimum Bisection in the Planted Bisection Model. APPROX-RANDOM 2015: 710-725 - [i2]Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch:
How does the core sit inside the mantle? CoRR abs/1503.09030 (2015) - [i1]Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch:
The minimum bisection in the planted bisection model. CoRR abs/1505.02985 (2015)
2000 – 2009
- 2009
- [j7]Oliver Cooley
Embeddings and Ramsey numbers of sparse kappa-uniform hypergraphs. Comb. 29(3): 263-297 (2009) - [j6]Oliver Cooley
Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs. Discret. Math. 309(21): 6190-6228 (2009) - [j5]Peter Allen, Julia Böttcher
Minimum degree conditions for large subgraphs. Electron. Notes Discret. Math. 34: 75-79 (2009) - [j4]Oliver Cooley
Loebl-Komlós-Sós Conjecture: dense case. Electron. Notes Discret. Math. 34: 609-613 (2009) - 2008
- [j3]Oliver Cooley
3-Uniform hypergraphs of bounded degree have linear Ramsey numbers. J. Comb. Theory B 98(3): 484-505 (2008) - 2007
- [j2]Oliver Cooley
Perfect packings with complete graphs minus an edge. Eur. J. Comb. 28(8): 2143-2155 (2007) - [j1]Daniela Kühn, Oliver Cooley
Ramsey numbers of sparse hypergraphs. Electron. Notes Discret. Math. 29: 29-33 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: