Yury A. Person
person -at- informatik.hu-berlin.de

Postal address Humboldt-Universität zu Berlin Institut für Informatik 10099 Berlin, Germany Room 3.311 (House 3, 3rd floor, right) Johann von Neumann-Haus Rudower Chaussee 25 12489 Berlin

I am a PhD student at Humboldt-Universität zu Berlin, my advisor is Mathias Schacht (U Hamburg). I got my Diploma from TU Munich with Anusch Taraz. Before that I attended Saint Petersburg Lyceum 239.

Here is my CV.

Research interests
I am working in the area of extremal graph and hypergraph theory, a vivid branch within discrete mathematics. My further interests are probabilistic methods in discrete mathematics and theoretical computer science, Ramsey theory and connections of extremal combinatorics to additive number theory.

Research papers

• Minimum H-decompositions of graphs: edge-critical case, with L. Özkahya, in preparation.
• The number of hyperedge colorings for certain classes of hypergraphs, with H. Lefmann, in preparation.
• A structural result for hypergraphs with many restricted edge colorings, with H. Lefmann and M. Schacht, submitted.
• Weak quasi-randomness for uniform hypergraphs, with D.Conlon, H. Han and M. Schacht, submitted.
• An expected polynomial time algorithm for coloring 2- colorable 3-graphs, with M. Schacht, submitted, extended abstract appeared in Proceedings of EuroComb 09, Electronic Notes In Discrete Mathematics 34 (2009), 465–469.
• Note on strong refutation algorithms for random k-SAT formulas, with H. Han and M. Schacht, Proceedings of LAGOS, Electronic Notes in Discrete Mathematics 35 (2009) 157–162.
• Highly connected coloured subgraphs via the Regularity Lemma, with H. Liu, Discrete Mathematics Volume 309, Issue 21, 6277–6287 (2009).
• On colorings of hypergraphs without monochromatic Fano planes, with H. Lefmann, V. Rödl and M. Schacht, Combinatorics, Probability and Computing 18(5), 803-818 (2009).
• On perfect matchings in uniform hypergraphs with large minimum vertex degree, with H.Han and M. Schacht, SIAM J. Discrete Math. Volume 23, Issue 2, pp. 732-748 (2009).
• Almost all hypergraphs without Fano planes are bipartite, with M. Schacht, ACM Press, In: Claire Mathieu (editor): Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 09), 217–226.

Favorite links
Mathematics : Tao's blog, Gowers's blog
Nonmathematical stuff: Berlin's best antique restorer, German online news magazine "Spiegel"

Disclaimer
Für alle Links auf dieser Homepage gilt: Ich distanziere mich hiermit ausdrücklich von allen Inhalten aller verlinkten Seitenadressen auf meiner Homepage und mache mir diese Inhalte nicht zu eigen.