11 Einträge gefunden

1. A spanning bandwidth theorem in random graphs

   1. Allen, Peter
   2. Böttcher, Julia
   3. Ehrenmüller, Julia
   4. Schnitzer, Jakob
   5. Taraz, Anusch

   2021 - TUHH Open Research
2. The bandwidth theorem in sparse graphs

   1. Allen, Peter
   2. Böttcher, Julia
   3. Ehrenmüller, Julia
   4. Taraz, Anusch

   2020 - TUHH Open Research - frei zugänglich
3. A dirac-type theorem for berge cycles in random hypergraphs

   1. Clemens, Dennis
   2. Ehrenmüller, Julia
   3. Person, Yury

   2020 - TUHH Open Research - frei zugänglich
4. Nonempty intersection of longest paths in series–parallel graphs

   1. Chen, Guantao
   2. Ehrenmüller, Julia
   3. Fernandes, Cristina G.
   4. Heise, Carl Georg
   5. Shan, Songling
   6. Yang, Ping
   7. Yates, Amy N.

   2017 - TUHH Open Research
5. Existence and enumeration of spanning structures in sparse graphs and hypergraphs

   1. Ehrenmüller, Julia

   2016 - TUHH Open Research - frei zugänglich
6. A Dirac-type theorem for Hamilton Berge cycles in random hypergraphs

   1. Clemens, Dennis
   2. Ehrenmüller, Julia
   3. Person, Yury

   2016 - TUHH Open Research
7. On sets not belonging to algebras and rainbow matchings in graphs

   1. Clemens, Dennis
   2. Ehrenmüller, Julia
   3. Pokrovskiy, Alexey

   2016 - TUHH Open Research
8. An improved bound on the sizes of matchings guaranteeing a rainbow matching

   1. Clemens, Dennis
   2. Ehrenmüller, Julia

   2016 - TUHH Open Research
9. Spanning trees in random series-parallel graphs

   1. Ehrenmüller, Julia
   2. Rué, Juanjo

   2016 - TUHH Open Research
10. Keeping Avoider’s graph almost acyclic

    1. Clemens, Dennis
    2. Ehrenmüller, Julia
    3. Person, Yury
    4. Tran, Tuan

    2015 - TUHH Open Research
11. Local resilience of spanning subgraphs in sparse random graphs

    1. Allen, Peter
    2. Böttcher, Julia
    3. Ehrenmüller, Julia
    4. Taraz, Anusch

    2015 - TUHH Open Research