Julia Ehrenmüller

According to our database1, Julia Ehrenmüller authored at least 8 papers between 2015 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
A Dirac-type Theorem for Berge Cycles in Random Hypergraphs.
Electron. J. Comb., 2020

2017
On sets not belonging to algebras and rainbow matchings in graphs.
J. Comb. Theory, Ser. B, 2017

Nonempty intersection of longest paths in series-parallel graphs.
Discret. Math., 2017

2016
A Dirac-type theorem for Hamilton Berge cycles in random hypergraphs.
Electron. Notes Discret. Math., 2016

An Improved Bound on the Sizes of Matchings Guaranteeing a Rainbow Matching.
Electron. J. Comb., 2016

Spanning trees in random series-parallel graphs.
Adv. Appl. Math., 2016

2015
Local resilience of spanning subgraphs in sparse random graphs.
Electron. Notes Discret. Math., 2015

Keeping Avoider's Graph Almost Acyclic.
Electron. J. Comb., 2015


  Loading...