Research page of Yury Person

Yury Person
person - at - math.uni-frankfurt.de

Address
Goethe-Universität
Institute of Mathematics
Robert-Mayer-Str. 10
Room 309a (3rd floor)
60325 Frankfurt, Germany

Phone: +49 69 798 25574

I am a Juniorprofessor at Goethe-University in Frankfurt am Main. Before that I was a PostDoc in the Discrete Mathematics and Combinatorics group of Tibor Szabó. I finished my PhD in 2010 at Humboldt-Universität zu Berlin, my advisor was Mathias Schacht (U Hamburg). I got my Diploma from TU Munich with Anusch Taraz. Before that I attended Saint Petersburg Lyceum 239.

Research interests

Combinatorics
Probabilistic Methods
Theoretical Computer Science

Research papers

Symmetric and asymmetric Ramsey properties in random hypergraphs, with L. Gugelmann, R. Nenadov, A. Steger, N. Skoric and H. Thomas submitted.
On universal hypergraphs, with S. Hetterich and O. Parczyk, submitted.
Largest components in random hypergraphs, with O. Cooley and M. Kang, submitted.
An algorithmic framework for obtaining lower bounds for random Ramsey problems, with R. Nenadov, A. Steger and N. Skoric, Journal of Combinatorial Theory, Series B, accepted.
Powers of Hamilton cycles in pseudorandom graphs, with P. Allen, J. Böttcher, H. Han and Y. Kohayakawa, Combinatorica, accepted.
Spanning structures and universality in sparse hypergraphs, with O. Parczyk, Random Structures & Algorithms, to appear.
A Dirac-type theorem for Hamilton Berge cycles in random hypergraphs, with D. Clemens and J. Ehrenmüller, Electronic Notes in Discrete Mathematics 54, 181--186, 2016.
Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs, with D. Clemens, Combinatorics, Probability and Computing 25, 850–869, 2016.
On the multicolor Ramsey number of a graph with m edges, with K. Johst, Discrete Mathematics 339 (12), 2857–2860, 2016.
A sharp threshold for van der Waerden's theorem in random subsets, with E. Friedgut, H. Han and M. Schacht, Discrete Analysis, 2016:7, 20 pp.
On the minimum degree of minimal Ramsey graphs for multiple colours, with J. Fox, A. Grinshpun, A. Liebenau and T. Szabó, Journal of Combinatorial Theory, Series B, 120, 64–82, 2016.
Tight Hamilton cycles in random hypergraphs, with P. Allen, J. Böttcher and Y. Kohayakawa, Random Structures & Algorithms, 46(3), 446–465, 2015.
Keeping Avoider's graph almost acyclic, with D. Clemens, J. Ehrenmüller and T. Tran, The Electronic Journal of Combinatorics 22 (1) (2015), #P1.60.
On the rank of higher inclusion matrices , with C. Grosu and T. Szabó, Journal of the London Mathematical Society 90 (2), 333–349, 2014.
What is Ramsey-equivalent to a clique?, with J. Fox, A. Grinshpun, A. Liebenau and T. Szabó, Journal of Combinatorial Theory, Series B, 109, 120–133, 2014.
An improved error term for minimum H-decompositions of graphs, with P. Allen and J. Böttcher, Journal of Combinatorial Theory, Series B, 108, 92–101, 2014.
An approximate blow-up lemma for sparse pseudorandom graphs, with P. Allen, J. Böttcher, H. Han and Y. Kohayakawa, Proceedings of LAGOS, Electronic Notes in Discrete Mathematics 44, 393–398, 2013.
A regularity lemma and twins in words, with M. Axenovich and S. Puzynina, Journal of Combinatorial Theory, Series A, 120 (4), 733–743, 2013.
A randomized version of Ramsey's theorem, with L. Gugelmann, A. Steger and H. Thomas, Random Structures & Algorithms, 41(4), 488–505, 2012. Extended abstract appeared in Proceedings of EuroComb 2011.
Exact results on the number of restricted edge colorings for some families of linear hypergraphs, with H. Lefmann, Journal of Graph Theory73 (1), 1–31, 2013.
Tree-minimal graphs are almost regular, with D. Dellamonica Jr., P. Haxell, T. Luczak, D. Mubayi, B. Nagle, V. Rödl, M. Schacht, Journal of Combinatorics, 3(1) (2012), 50–62.
On even-degree subgraphs of linear hypergraphs, with D. Dellamonica Jr., P. Haxell, T. Luczak, D. Mubayi, B. Nagle, V. Rödl, M. Schacht, J.Verstraete, Combinatorics, Probability and Computing, 21 (2012), 113–127.
On extremal hypergraphs for Hamiltonian cycles, with R. Glebov and W. Weps, European Journal of Combinatorics, 33 (2012), 544–555, extended abstract appeared in Proceedings of EuroComb 2011.
Minimum H-decompositions of graphs: edge-critical case, with L. Özkahya, Journal of Combinatorial Theory, Series B, Series B 102 (2012), 715–725.
Weak quasi-randomness for uniform hypergraphs, with D.Conlon, H. Han and M. Schacht, Random Structures & Algorithms 40 (1) (2012), 1–38.
Note on forcing pairs, with H. Han and M. Schacht, extended abstract appeared in Proceedings of EuroComb 2011.
An expected polynomial time algorithm for coloring 2-colorable 3-graphs, with M. Schacht, Discrete Mathematics & Theoretical Computer Science, 13(2) (2011), 1–18, extended abstract appeared in Proceedings of EuroComb 2009, Electronic Notes In Discrete Mathematics 34 (2009), 465–469.
A structural result for hypergraphs with many restricted edge colorings, with H. Lefmann and M. Schacht, Journal of Combinatorics 1(3-4) (2010), 441–475.
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.

Theses

Quasi-random hypergraphs and extremal problems for hypergraphs, PhD Thesis, Humboldt-Universität zu Berlin, Institut für Informatik, November 2010.
Counting spanning trees in dense graphs, Diploma Thesis, TU Munich, June 2007.

Kolloquium Mathematische Informatik

Teaching

Berlin-Poznan Seminar 2012

Mathe $T$

Favorite links
Mathematics : Tao's blog, Gowers's blog
Nonmathematical stuff: Berlin's best antique restorer

Impressum
Datenschutzerklärung
Yury Person, Goethe-Universität, Fachbereich 12, Institut für Mathematik, Robert-Mayer-Str. 10, 3.OG, 60325 Frankfurt; Tel.: +49 69 798 25574 person - at - math.uni-frankfurt.de
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.