default search action
Peter Allen 0001
Person information
- affiliation: London School of Economics, Department of Mathematics, United Kingdom
Other persons with the same name
- Peter Allen — disambiguation page
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j32]Domenico Mergoni Cecchelli, Peter Allen, Jozef Skokan
, Barnaby Roberts:
The Ramsey Numbers of Squares of Paths and Cycles. Electron. J. Comb. 31(2) (2024) - [j31]Peter Allen, Julia Böttcher, Richard Lang, Jozef Skokan
Partitioning a 2-edge-coloured graph of minimum degree 2n/3+o(n) into three monochromatic cycles. Eur. J. Comb. 121: 103838 (2024) - 2023
- [j30]Peter Allen, Tomasz Luczak
The Ramsey number of a long even cycle versus a star. J. Comb. Theory B 162: 144-153 (2023) - 2022
- [j29]Peter Allen, Julia Böttcher
A spanning bandwidth theorem in random graphs. Comb. Probab. Comput. 31(4): 598-628 (2022) - 2021
- [c3]Peter Allen, Julia Böttcher
An Approximate Blow-up Lemma for Sparse Hypergraphs. LAGOS 2021: 394-403 - 2020
- [j28]Peter Allen, Julia Böttcher
Regularity inheritance in pseudorandom graphs. Random Struct. Algorithms 56(2): 306-338 (2020) - [j27]Anna Adamaszek, Peter Allen, Codrut Grosu, Jan Hladký
Almost all trees are almost graceful. Random Struct. Algorithms 56(4): 948-987 (2020)
2010 – 2019
- 2018
- [j26]Peter Allen, Julia Böttcher
Triangle-Free Subgraphs of Random Graphs. Comb. Probab. Comput. 27(2): 141-161 (2018) - [c2]Peter Allen, Christoph Koch, Olaf Parczyk
Finding Tight Hamilton Cycles in Random Hypergraphs Faster. LATIN 2018: 28-36 - 2017
- [j25]Peter Allen, Julia Böttcher
Powers of Hamilton cycles in pseudorandom graphs. Comb. 37(4): 573-616 (2017) - [j24]Peter Allen, Julia Böttcher
Packing degenerate graphs greedily. Electron. Notes Discret. Math. 61: 45-51 (2017) - [j23]Peter Allen, Julia Böttcher
Tight cycles and regular slices in dense hypergraphs. J. Comb. Theory A 149: 30-100 (2017) - [j22]Peter Allen, Julia Böttcher
Chromatic thresholds in dense random graphs. Random Struct. Algorithms 51(2): 185-214 (2017) - [j21]Peter Allen, Julia Böttcher
Chromatic thresholds in sparse random graphs. Random Struct. Algorithms 51(2): 215-236 (2017) - 2015
- [j20]Peter Allen, Julia Böttcher
Triangle-Free Subgraphs of Random Graphs. Electron. Notes Discret. Math. 49: 393-397 (2015) - [j19]Peter Allen, Julia Böttcher
Local resilience of spanning subgraphs in sparse random graphs. Electron. Notes Discret. Math. 49: 513-521 (2015) - [j18]Peter Allen, Barnaby Roberts, Jozef Skokan
Ramsey Numbers of Squares of Paths. Electron. Notes Discret. Math. 49: 637-641 (2015) - [j17]Peter Allen, Julia Böttcher
Tight Cycles in Hypergraphs. Electron. Notes Discret. Math. 49: 675-682 (2015) - [j16]Peter Allen, Julia Böttcher
Regular slices for hypergraphs. Electron. Notes Discret. Math. 49: 691-698 (2015) - [j15]Peter Allen, Julia Böttcher
Tight Hamilton cycles in random hypergraphs. Random Struct. Algorithms 46(3): 446-465 (2015) - 2014
- [j14]Peter Allen, Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Roberto F. Parente:
On the Number of Orientations of Random Graphs with No Directed Cycles of a Given Length. Electron. J. Comb. 21(1): 1 (2014) - [j13]Peter Allen, Julia Böttcher, Jan Hladký, Diana Piguet:
An Extension of Turán's Theorem, Uniqueness and Stability. Electron. J. Comb. 21(4): 4 (2014) - [j12]Peter Allen, Peter Keevash, Benny Sudakov, Jacques Verstraëte:
Turán numbers of bipartite graphs plus an odd cycle. J. Comb. Theory B 106: 134-162 (2014) - [j11]Peter Allen, Julia Böttcher
An improved error term for minimum H-decompositions of graphs. J. Comb. Theory B 108: 92-101 (2014) - [c1]Peter Allen, Julia Böttcher
Powers of Hamilton Cycles in Pseudorandom Graphs. LATIN 2014: 355-366 - 2013
- [j10]Peter Allen, Graham R. Brightwell, Jozef Skokan
Ramsey-goodness - and otherwise. Comb. 33(2): 125-160 (2013) - [j9]Peter Allen, Jozef Skokan
Maximum Planar Subgraphs in Dense Graphs. Electron. J. Comb. 20(3): 1 (2013) - [j8]Peter Allen, Julia Böttcher
An approximate blow-up lemma for sparse pseudorandom graphs. Electron. Notes Discret. Math. 44: 393-398 (2013) - [j7]Peter Allen, Julia Böttcher
Turánnical hypergraphs. Random Struct. Algorithms 42(1): 29-58 (2013) - 2011
- [j6]Peter Allen, Julia Böttcher
A density Corrádi-Hajnal theorem. Electron. Notes Discret. Math. 38: 31-36 (2011) - [j5]Peter Allen, Julia Böttcher
Filling the gap between Turán's theorem and Pósa's conjecture. J. Lond. Math. Soc. 84(2): 269-302 (2011) - 2010
- [j4]Peter Allen:
Dense H-Free Graphs are Almost (χ(H)-1)-Partite. Electron. J. Comb. 17(1) (2010)
2000 – 2009
- 2009
- [j3]Peter Allen, Vadim V. Lozin, Michaël Rao:
Clique-Width and the Speed of Hereditary Properties. Electron. J. Comb. 16(1) (2009) - [j2]Peter Allen, Julia Böttcher
Minimum degree conditions for large subgraphs. Electron. Notes Discret. Math. 34: 75-79 (2009) - 2008
- [j1]Peter Allen:
Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles. Comb. Probab. Comput. 17(4): 471-486 (2008)
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:25 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: