9 Einträge gefunden

1. 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
2. Quasirandomness in hypergraphs

   1. Aigner-Horev, Elad
   2. Conlon, David
   3. Hàn, Hiep
   4. Person, Yury
   5. Schacht, Mathias

   2018 - Forschungsinformationssystem der UHH - frei zugänglich
3. 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
4. Minimum Degrees and Codegrees of Ramsey-Minimal 3-Uniform Hypergraphs

   1. Clemens, Dennis
   2. Person, Yury

   2016 - TUHH Open Research
5. Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs

   1. Clemens, Dennis
   2. Person, Yury

   2015 - TUHH Open Research
6. Keeping Avoider’s graph almost acyclic

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

   2015 - TUHH Open Research
7. An expected polynomial time algorithm for coloring 2-colorable 3-graphs

   1. Person, Yury
   2. Schacht, Mathias

   2011 - Forschungsinformationssystem der UHH - frei zugänglich
8. A structural result for hypergraphs with many restricted edge colorings

   1. Lefmann, Hanno
   2. Person, Yury
   3. Schacht, Mathias

   2010 - Forschungsinformationssystem der UHH
9. An expected polynomial time algorithm for coloring 2-colorable 3-graphs

   1. Person, Yury
   2. Schacht, Mathias

   2009 - Forschungsinformationssystem der UHH