Julia Ehrenmüller

According to our database, Julia Ehrenmüller authored at least 9 papers between 2015 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of two.

2022

A spanning bandwidth theorem in random graphs.

Peter Allen, Julia Böttcher, Julia Ehrenmüller, Jakob Schnitzer, Anusch Taraz

Comb. Probab. Comput., 2022

2020

A Dirac-type Theorem for Berge Cycles in Random Hypergraphs.

Dennis Clemens, Julia Ehrenmüller, Yury Person

Electron. J. Comb., 2020

2017

On sets not belonging to algebras and rainbow matchings in graphs.

Dennis Clemens, Julia Ehrenmüller, Alexey Pokrovskiy

J. Comb. Theory B, 2017

Nonempty intersection of longest paths in series-parallel graphs.

Guantao Chen, Julia Ehrenmüller, Cristina G. Fernandes, Carl Georg Heise, Songling Shan, Ping Yang, Amy N. Yates

Discret. Math., 2017

2016

A Dirac-type theorem for Hamilton Berge cycles in random hypergraphs.

Dennis Clemens, Julia Ehrenmüller, Yury Person

Electron. Notes Discret. Math., 2016

An Improved Bound on the Sizes of Matchings Guaranteeing a Rainbow Matching.

Dennis Clemens, Julia Ehrenmüller

Electron. J. Comb., 2016

Spanning trees in random series-parallel graphs.

Julia Ehrenmüller, Juanjo Rué

Adv. Appl. Math., 2016

2015

Local resilience of spanning subgraphs in sparse random graphs.

Peter Allen, Julia Böttcher, Julia Ehrenmüller, Anusch Taraz

Electron. Notes Discret. Math., 2015

Keeping Avoider's Graph Almost Acyclic.

Dennis Clemens, Julia Ehrenmüller, Yury Person, Tuan Tran

Electron. J. Comb., 2015