default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRichard Mycroft
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j20]Candida Bowtell, Richard Mycroft:
Classification of Maximum Hittings by Large Families. Graphs Comb. 36(1): 27-39 (2020)
2010 – 2019
- 2019
- [c4]Allan Lo, Richard Mycroft, Guillem Perarnau, Andrew Treglown:
Preface. BCC 2019: vii-viii - [c3]Richard Mycroft, Tássio Naia
:
Spanning Trees of Dense Directed Graphs. LAGOS 2019: 645-654 - [e1]Allan Lo, Richard Mycroft, Guillem Perarnau, Andrew Treglown:
Surveys in Combinatorics, 2019: Invited lectures from the 27th British Combinatorial Conference, Birmingham, UK, July 29 - August 2, 2019. Cambridge University Press 2019, ISBN 978-1-108-74072-2 [contents] - 2018
- [j19]Andrew McDowell, Richard Mycroft:
Hamilton ℓ-Cycles in Randomly Perturbed Hypergraphs. Electron. J. Comb. 25(4): 4 (2018) - [j18]József Balogh, Andrew McDowell, Theodore Molla, Richard Mycroft:
Triangle-Tilings in Graphs Without Large Independent Sets. Comb. Probab. Comput. 27(4): 449-474 (2018) - [j17]Frederik Garbe, Richard Mycroft:
Hamilton cycles in hypergraphs below the Dirac threshold. J. Comb. Theory B 133: 153-210 (2018) - [j16]Richard Mycroft, Tássio Naia:
Unavoidable trees in tournaments. Random Struct. Algorithms 53(2): 352-385 (2018) - [j15]Frederik Garbe, Richard Mycroft, Andrew McDowell:
Contagious sets in a degree-proportional bootstrap percolation process. Random Struct. Algorithms 53(4): 638-651 (2018) - 2017
- [j14]Oliver Cooley, Richard Mycroft:
The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph. Discret. Math. 340(6): 1172-1179 (2017) - [j13]Peter Allen, Julia Böttcher, Oliver Cooley, Richard Mycroft:
Tight cycles and regular slices in dense hypergraphs. J. Comb. Theory A 149: 30-100 (2017) - [j12]Ryan R. Martin, Richard Mycroft, Jozef Skokan:
An Asymptotic Multipartite Kühn-Osthus Theorem. SIAM J. Discret. Math. 31(3): 1498-1513 (2017) - 2016
- [j11]Richard Mycroft:
Packing k-partite k-uniform hypergraphs. J. Comb. Theory A 138: 60-132 (2016) - [j10]John Lenz, Dhruv Mubayi, Richard Mycroft:
Hamilton cycles in quasirandom hypergraphs. Random Struct. Algorithms 49(2): 363-378 (2016) - [c2]Frederik Garbe, Richard Mycroft:
The Complexity of the Hamilton Cycle Problem in Hypergraphs of High Minimum Codegree. STACS 2016: 38:1-38:13 - 2015
- [j9]Peter Allen, Julia Böttcher, Oliver Cooley, Richard Mycroft:
Tight Cycles in Hypergraphs. Electron. Notes Discret. Math. 49: 675-682 (2015) - [j8]Peter Allen, Julia Böttcher, Oliver Cooley, Richard Mycroft:
Regular slices for hypergraphs. Electron. Notes Discret. Math. 49: 691-698 (2015) - [j7]Peter Keevash, Richard Mycroft:
A multipartite Hajnal-Szemerédi theorem. J. Comb. Theory B 114: 187-236 (2015) - 2014
- [j6]József Balogh, Richard Mycroft, Andrew Treglown:
A random version of Sperner's theorem. J. Comb. Theory A 128: 104-110 (2014) - 2013
- [c1]Peter Keevash, Fiachra Knox, Richard Mycroft:
Polynomial-time perfect matchings in dense hypergraphs. STOC 2013: 311-320 - 2011
- [j5]Peter Keevash, Daniela Kühn, Richard Mycroft, Deryk Osthus:
Loose Hamilton cycles in hypergraphs. Discret. Math. 311(7): 544-559 (2011) - [j4]Richard Mycroft:
Packing k-partite k-uniform hypergraphs. Electron. Notes Discret. Math. 38: 663-668 (2011) - [j3]Deryk Osthus, Daniela Kühn, Richard Mycroft:
A proof of Sumner's universal tournament conjecture for large tournaments. Electron. Notes Discret. Math. 38: 687-692 (2011) - [j2]Daniela Kühn, Richard Mycroft, Deryk Osthus:
An approximate version of Sumnerʼs universal tournament conjecture. J. Comb. Theory B 101(6): 415-447 (2011) - 2010
- [j1]Daniela Kühn, Richard Mycroft, Deryk Osthus:
Hamilton l-cycles in uniform hypergraphs. J. Comb. Theory A 117(7): 910-927 (2010)
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-10-07 21:20 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:
