30 citations · 73 across the 19 of their papers we have counts for
23 papers
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…
The density of graphs with no -path connecting equal-degree vertices: a short proof
Yamaan Attwa, Matías Azócar Carvajal, Simona Boyadzhiyska +2
Addressing a question posed by Chen and Ma from an asymptotic point of view, we present a short proof for the edge density needed to guarantee that two vertices of the same degree…
Randomized algorithms to generate hypergraphs with given degree sequences
Michela Ascolese, Matthias Lienau, Matthias Schulte +1
The question whether there exists a hypergraph whose degrees are equal to a given sequence of integers is a well-known reconstruction problem in graph theory, which is motivated by…
The tree packing conjecture for trees of almost linear maximum degree
Peter Allen, Julia Böttcher, Dennis Clemens +3
We prove that there is such that for all sufficiently large , if are any trees such that has vertices and maximum degree at most , the…
A spanning bandwidth theorem in random graphs
Peter Allen, Julia Böttcher, Julia Ehrenmüller +2
The bandwidth theorem [Mathematische Annalen, 343(1):175--205, 2009] states that any -vertex graph with minimum degree contains all -vertex -co…
Perfectly packing graphs with bounded degeneracy and many leaves
Peter Allen, Julia Böttcher, Dennis Clemens +1
We prove that one can perfectly pack degenerate graphs into complete or dense -vertex quasirandom graphs, provided that all the degenerate graphs have maximum degree $o(\frac{n}…