Peter Allen - RankMe

39 papers B 2C 2Journal 35

Year	Rank	Type	Title / Venue / Authors
2025	C	`conf`	Universality for degenerate hypergraphs. LAGOS Peter Allen, Julia Böttcher, Jasmin Katz
2024	J	`jnl`	A robust Corrádi-Hajnal theorem. Random Struct. Algorithms Peter Allen, Julia Böttcher, Jan Corsten, Ewan Davies, Matthew Jenssen, Patrick Morris, Barnaby Roberts, Jozef Skokan
2024	J	`jnl`	Partitioning a 2-edge-coloured graph of minimum degree 2n/3+o(n) into three monochromatic cycles. Eur. J. Comb. Peter Allen, Julia Böttcher, Richard Lang, Jozef Skokan, Maya Stein
2024	J	`jnl`	Resilience for tight Hamiltonicity. Comb. Theory Peter Allen, Olaf Parczyk, Vincent Pfenninger
2024	J	`jnl`	The Ramsey Numbers of Squares of Paths and Cycles. Electron. J. Comb. Domenico Mergoni Cecchelli, Peter Allen, Jozef Skokan, Barnaby Roberts
2023	J	`jnl`	The Ramsey number of a long even cycle versus a star. J. Comb. Theory B Peter Allen, Tomasz Luczak, Joanna Polcyn, Yanbo Zhang
2022	J	`jnl`	A spanning bandwidth theorem in random graphs. Comb. Probab. Comput. Peter Allen, Julia Böttcher, Julia Ehrenmüller, Jakob Schnitzer, Anusch Taraz
2021	C	`conf`	An Approximate Blow-up Lemma for Sparse Hypergraphs. LAGOS Peter Allen, Julia Böttcher, Eng Keat Hng, Jozef Skokan, Ewan Davies
2020	J	`jnl`	Almost all trees are almost graceful. Random Struct. Algorithms Anna Adamaszek, Peter Allen, Codrut Grosu, Jan Hladký
2020	J	`jnl`	Regularity inheritance in pseudorandom graphs. Random Struct. Algorithms Peter Allen, Julia Böttcher, Jozef Skokan, Maya Stein
2018	B	`conf`	Finding Tight Hamilton Cycles in Random Hypergraphs Faster. LATIN Peter Allen, Christoph Koch, Olaf Parczyk, Yury Person
2018	J	`jnl`	Triangle-Free Subgraphs of Random Graphs. Comb. Probab. Comput. Peter Allen, Julia Böttcher, Yoshiharu Kohayakawa, Barnaby Roberts
2017	J	`jnl`	Chromatic thresholds in dense random graphs. Random Struct. Algorithms Peter Allen, Julia Böttcher, Simon Griffiths, Yoshiharu Kohayakawa, Robert Morris
2017	J	`jnl`	Chromatic thresholds in sparse random graphs. Random Struct. Algorithms Peter Allen, Julia Böttcher, Simon Griffiths, Yoshiharu Kohayakawa, Robert Morris
2017	J	`jnl`	Packing degenerate graphs greedily. Electron. Notes Discret. Math. Peter Allen, Julia Böttcher, Jan Hladký, Diana Piguet
2017	J	`jnl`	Powers of Hamilton cycles in pseudorandom graphs. Comb. Peter Allen, Julia Böttcher, Hiêp Hàn, Yoshiharu Kohayakawa, Yury Person
2017	J	`jnl`	Tight cycles and regular slices in dense hypergraphs. J. Comb. Theory A Peter Allen, Julia Böttcher, Oliver Cooley, Richard Mycroft
2015	J	`jnl`	Local resilience of spanning subgraphs in sparse random graphs. Electron. Notes Discret. Math. Peter Allen, Julia Böttcher, Julia Ehrenmüller, Anusch Taraz
2015	J	`jnl`	Ramsey Numbers of Squares of Paths. Electron. Notes Discret. Math. Peter Allen, Barnaby Roberts, Jozef Skokan
2015	J	`jnl`	Regular slices for hypergraphs. Electron. Notes Discret. Math. Peter Allen, Julia Böttcher, Oliver Cooley, Richard Mycroft
2015	J	`jnl`	Tight Cycles in Hypergraphs. Electron. Notes Discret. Math. Peter Allen, Julia Böttcher, Oliver Cooley, Richard Mycroft
2015	J	`jnl`	Tight Hamilton cycles in random hypergraphs. Random Struct. Algorithms Peter Allen, Julia Böttcher, Yoshiharu Kohayakawa, Yury Person
2015	J	`jnl`	Triangle-Free Subgraphs of Random Graphs. Electron. Notes Discret. Math. Peter Allen, Julia Böttcher, Barnaby Roberts, Yoshiharu Kohayakawa
2014	J	`jnl`	An Extension of Turán's Theorem, Uniqueness and Stability. Electron. J. Comb. Peter Allen, Julia Böttcher, Jan Hladký, Diana Piguet
2014	J	`jnl`	An improved error term for minimum H-decompositions of graphs. J. Comb. Theory B Peter Allen, Julia Böttcher, Yury Person
2014	J	`jnl`	On the Number of Orientations of Random Graphs with No Directed Cycles of a Given Length. Electron. J. Comb. Peter Allen, Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Roberto F. Parente
2014	B	`conf`	Powers of Hamilton Cycles in Pseudorandom Graphs. LATIN Peter Allen, Julia Böttcher, Hiêp Hàn, Yoshiharu Kohayakawa, Yury Person
2014	J	`jnl`	Turán numbers of bipartite graphs plus an odd cycle. J. Comb. Theory B Peter Allen, Peter Keevash, Benny Sudakov, Jacques Verstraëte
2013	J	`jnl`	An approximate blow-up lemma for sparse pseudorandom graphs. Electron. Notes Discret. Math. Peter Allen, Julia Böttcher, Hiêp Hàn, Yoshiharu Kohayakawa, Yury Person
2013	J	`jnl`	Maximum Planar Subgraphs in Dense Graphs. Electron. J. Comb. Peter Allen, Jozef Skokan, Andreas Würfl
2013	J	`jnl`	Ramsey-goodness - and otherwise. Comb. Peter Allen, Graham R. Brightwell, Jozef Skokan
2013	J	`jnl`	Turánnical hypergraphs. Random Struct. Algorithms Peter Allen, Julia Böttcher, Jan Hladký, Diana Piguet
2011	J	`jnl`	A density Corrádi-Hajnal theorem. Electron. Notes Discret. Math. Peter Allen, Julia Böttcher, Jan Hladký, Diana Piguet
2011	J	`jnl`	Filling the gap between Turán's theorem and Pósa's conjecture. J. Lond. Math. Soc. Peter Allen, Julia Böttcher, Jan Hladký
2010	J	`jnl`	Dense H-Free Graphs are Almost ( Electron. J. Comb. Peter Allen
2009	J	`jnl`	Clique-Width and the Speed of Hereditary Properties. Electron. J. Comb. Peter Allen, Vadim V. Lozin, Michaël Rao
2009	J	`jnl`	Forbidden induced bipartite graphs. J. Graph Theory Peter Allen
2009	J	`jnl`	Minimum degree conditions for large subgraphs. Electron. Notes Discret. Math. Peter Allen, Julia Böttcher, Jan Hladký, Oliver Cooley
2008	J	`jnl`	Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles. Comb. Probab. Comput. Peter Allen