default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPatrick Morris 0001
Person information
- affiliation: Polytecnical University of Catalunya, Barcelona, Spain
- affiliation: Free University of Berlin, Institute of Mathematics, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j11]David Fabian, Patrick Morris
, Tibor Szabó:
Slow graph bootstrap percolation II: Accelerating properties. J. Comb. Theory B 172: 44-79 (2025)- 2024
- [j10]Shagnik Das, Charlotte Knierim, Patrick Morris:
Schur properties of randomly perturbed sets. Eur. J. Comb. 121: 103843 (2024) - [j9]Jie Han, Patrick Morris, Guanghui Wang, Donglei Yang:
A Ramsey-Turán theory for tilings in graphs. Random Struct. Algorithms 64(1): 94-124 (2024) - [j8]Peter Allen, Julia Böttcher, Jan Corsten, Ewan Davies, Matthew Jenssen, Patrick Morris, Barnaby Roberts, Jozef Skokan:
A robust Corrádi-Hajnal theorem. Random Struct. Algorithms 65(1): 61-130 (2024) - 2023
- [c3]José D. Alvarado, Yoshiharu Kohayakawa, Patrick Morris, Guilherme Oliveira Mota:
A canonical Ramsey theorem with list constraints in random graphs. LAGOS 2023: 13-19 - 2022
- [j7]Yulin Chang, Jie Han, Yoshiharu Kohayakawa, Patrick Morris, Guilherme Oliveira Mota:
Factors in randomly perturbed hypergraphs. Random Struct. Algorithms 60(2): 153-165 (2022) - [j6]Hiêp Hàn, Jie Han, Patrick Morris:
Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs. Random Struct. Algorithms 61(1): 101-125 (2022) - [i2]Alberto Espuny Díaz, Patrick Morris, Guillem Perarnau, Oriol Serra:
Speeding up random walk mixing by starting from a uniform vertex. CoRR abs/2208.07462 (2022) - 2021
- [j5]Anurag Bishnoi, Shagnik Das, Patrick Morris, Tibor Szabó:
Ryser's Conjecture for t-intersecting hypergraphs. J. Comb. Theory A 179: 105366 (2021) - [j4]Jie Han, Yoshiharu Kohayakawa, Patrick Morris, Yury Person:
Finding any given 2-factor in sparse pseudorandom graphs efficiently. J. Graph Theory 96(1): 87-108 (2021) - [j3]Jie Han, Patrick Morris, Andrew Treglown:
Tilings in randomly perturbed graphs: Bridging the gap between Hajnal-Szemerédi and Johansson-Kahn-Vu. Random Struct. Algorithms 58(3): 480-516 (2021) - [c2]Patrick Morris:
A tight condition for triangle factors in pseudorandom graphs. SODA 2021: 890-918 - 2020
- [j2]Shagnik Das, Patrick Morris, Andrew Treglown:
Vertex Ramsey properties of randomly perturbed graphs. Random Struct. Algorithms 57(4): 983-1006 (2020) - [c1]Hiêp Hàn, Jie Han, Patrick Morris:
Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs. SODA 2020: 702-717
2010 – 2019
- 2019
- [j1]Jie Han, Yoshiharu Kohayakawa, Patrick Morris, Yury Person:
Clique-factors in sparse pseudorandom graphs. Eur. J. Comb. 82 (2019) - [i1]Jie Han, Yoshiharu Kohayakawa, Patrick Morris, Yury Person:
Finding any given 2-factor in sparse pseudorandom graphs efficiently. CoRR abs/1902.06164 (2019)
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 2025-06-16 23:58 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:
