20 citations · 71 across the 33 of their papers we have counts for
41 papers
Local Resilience for Containment of Bounded Degree Spanning Subgraphs
Peter Allen, Julia Böttcher, Yoshiharu Kohayakawa +1
We prove that for all and , there exists a constant such that for , asymptotically almost surely, every spanning subgraph …
Sharp bounds for the fractional chromatic number of high-girth -degenerate graphs
Peter Allen, Abhishek Dhawan, Jonathan A. Noel
Martinsson and Steiner recently proved that the fractional chromatic number of any -degenerate triangle-free graph satisfies . They…
A generalised transference principle
Peter Allen, Julia Böttcher, Joanna Lada +1
The last two decades have witnessed a growing trend towards proving sparse random analogues of combinatorial theorems. One unified approach to proving such theorems, formalised by…
Breaking the Bollobás-Eldridge-Catlin Barrier for Bipartite Graphs
Peter Allen, Julia Böttcher, Jozef Skokan +1
The celebrated Bollobás-Eldridge-Catlin packing conjecture states that every -vertex graph with minimum degree at least contains every -vert…
On Ramsey-type problems for paths and cycles with few colour changes
Peter Allen, Julia Böttcher, Dennis Clemens +3
In 1967, Gerencser and Gyárfás determined the exact values of the two-colour Ramsey numbers of paths. In a footnote, they made the following observation: Every -edge-coloured co…
Bounds for Hypergraph Universality
Peter Allen, Julia Böttcher, Jasmin Katz
A graph is said to be universal for a class of graphs if contains a copy of every as a subgraph. The number of edges required for a host g…