Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRichard Montgomery 0001
Person information
- affiliation: University of Warwick, Coventry, UK
- affiliation (former): University of Birmingham, School of Mathematics, UK
- affiliation (former): University of Cambridge, UK
Other persons with the same name
- Richard Montgomery 0002 — University of California, Santa Cruz, Department of Mathematics, CA, USA (and 1 more)
- Richard Montgomery 0003 — University of West Virginia, Department of Philosophy, Morgantown, WV, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c1]Matija Bucic
, Richard Montgomery:
Towards the Erdős-Gallai Cycle Decomposition Conjecture. STOC 2023: 839-852- 2022
- [j17]Alistair Benford, Richard Montgomery:
Trees with few leaves in tournaments. J. Comb. Theory, Ser. B 155: 141-170 (2022) - [j16]Amarja Kathapurkar, Richard Montgomery:
Spanning trees in dense directed graphs. J. Comb. Theory, Ser. B 156: 223-249 (2022) - 2021
- [j15]Stefan Glock, Daniela Kühn, Richard Montgomery, Deryk Osthus:
Decompositions into isomorphic rainbow spanning trees. J. Comb. Theory, Ser. B 146: 439-484 (2021) - 2020
- [j14]Richard Montgomery:
Hamiltonicity in random directed graphs is born resilient. Comb. Probab. Comput. 29(6): 900-942 (2020) - [j13]Ben Barber, Stefan Glock, Daniela Kühn, Allan Lo, Richard Montgomery, Deryk Osthus:
Minimalist designs. Random Struct. Algorithms 57(1): 47-63 (2020)
2010 – 2019
- 2019
- [j12]Agelos Georgakopoulos, John Haslegrave, Richard Montgomery:
Forcing large tight components in 3-graphs. Eur. J. Comb. 77: 57-67 (2019) - [j11]Stefan Glock, Daniela Kühn, Allan Lo, Richard Montgomery, Deryk Osthus:
On the decomposition threshold of a given graph. J. Comb. Theory, Ser. B 139: 47-127 (2019) - [j10]Richard Montgomery:
Hamiltonicity in random graphs is born resilient. J. Comb. Theory, Ser. B 139: 316-341 (2019) - [j9]Richard Montgomery:
Fractional clique decompositions of dense graphs. Random Struct. Algorithms 54(4): 779-796 (2019) - [j8]Julia Böttcher, Jie Han, Yoshiharu Kohayakawa, Richard Montgomery, Olaf Parczyk, Yury Person:
Universality for bounded degree spanning trees in randomly perturbed graphs. Random Struct. Algorithms 55(4): 854-864 (2019) - 2018
- [j7]József Balogh, Hong Liu, Richard Montgomery:
Rainbow spanning trees in properly coloured complete graphs. Discret. Appl. Math. 247: 97-101 (2018) - 2017
- [j6]Richard Montgomery:
Fractional Clique Decompositions of Dense Partite Graphs. Comb. Probab. Comput. 26(6): 911-943 (2017) - [j5]Julia Böttcher, Richard Montgomery, Olaf Parczyk, Yury Person:
Embedding spanning bounded degree subgraphs in randomly perturbed graphs. Electron. Notes Discret. Math. 61: 155-161 (2017) - [j4]Ben Barber, Daniela Kühn, Allan Lo, Richard Montgomery, Deryk Osthus:
Fractional clique decompositions of dense graphs and hypergraphs. J. Comb. Theory, Ser. B 127: 148-186 (2017) - [j3]Hong Liu, Richard Montgomery:
A proof of Mader's conjecture on large clique subdivisions in C4-free graphs. J. Lond. Math. Soc. 95(1): 203-222 (2017) - 2015
- [j2]Richard Montgomery:
Logarithmically small minors and topological minors. J. Lond. Math. Soc. 91(1): 71-88 (2015) - [j1]Richard Montgomery:
Almost All Friendly Matrices Have Many Obstructions. SIAM J. Discret. Math. 29(1): 421-430 (2015)
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 2023-10-01 22:32 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:
