From the 1 of 8 linked papers with an AI index.
1 citations · 1 across the 4 of their papers we have counts for
8 papers
Sharp bounds for the fractional chromatic number of high-girth -degenerate graphs
Peter Allen, Abhishek Dhawan, Jonathan A. Noel
The paper proves tight upper and lower bounds of order d/log d for the fractional chromatic number of high‑girth d‑degenerate graphs, provides a randomized algorithm achieving the…
Breaking the Bollobás-Eldridge-Catlin Barrier for Bipartite Graphs
Peter Allen, Julia Böttcher, Julia Böttcher +2
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…
A robust Corrádi--Hajnal Theorem
Peter Allen, Julia Böttcher, Jan Corsten +5
For a graph and , we denote by the random sparsification of obtained by keeping each edge of independently, with probability . We show that there ex…
Ramsey numbers for 1-degenerate 3-graphs
Peter Allen, Simona Boyadzhiyska, MatÃas Pavez-Signé
We construct a 3-uniform 1-degenerate hypergraph on vertices whose 2-colour Ramsey number is . This shows that all remaining open cases of the hyper…
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…