Julia Ehrenmüller

collaborators

2 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 $n$ -vertex graph $G$ with minimum degree $(\frac{k - 1}{k} + o (1)) n$ contains all $n$ -vertex $k$ -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 $n$ matchings of size $n + 1$ in a bipartite multigraph contains a rainbow matching of size $n$ . In this paper we prove…