33 citations · 33 across the 1 of their papers we have counts for
3 papers
math.CO2019
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…
math.CO2015
An improved bound on the sizes of matchings guaranteeing a rainbow matching
Dennis Clemens, Julia Ehrenmüller
A conjecture by Aharoni and Berger states that every family of matchings of size in a bipartite multigraph contains a rainbow matching of size . In this paper we prove…
math.CO2013★ 33 cited
Nonempty Intersection of Longest Paths in Series-Parallel Graphs
Julia Ehrenmüller, Cristina G. Fernandes, Carl Georg Heise
In 1966 Gallai asked whether all longest paths in a connected graph have nonempty intersection. This is not true in general and various counterexamples have been found. However, th…