Yury Person

Orcid: 0000-0002-3091-3025

  • Goethe University of Frankfurt, Germany

According to our database1, Yury Person authored at least 45 papers between 2009 and 2023.

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



In proceedings 
PhD thesis 


Online presence:

On csauthors.net:


Spanning -cycles in random graphs.
Comb. Probab. Comput., September, 2023

An asymmetric random Rado theorem: 1-statement.
J. Comb. Theory A, 2023

On sparse random combinatorial matrices.
Discret. Math., 2022

Finding any given 2-factor in sparse pseudorandom graphs efficiently.
J. Graph Theory, 2021

Minimum degree conditions for containing an r-regular r-connected subgraph.
CoRR, 2021

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

Monochromatic Schur Triples in Randomly Perturbed Dense Sets of Integers.
SIAM J. Discret. Math., 2019

Universality for bounded degree spanning trees in randomly perturbed graphs.
Random Struct. Algorithms, 2019

Clique-factors in sparse pseudorandom graphs.
Eur. J. Comb., 2019

Near-perfect clique-factors in sparse pseudorandom graphs.
Electron. Notes Discret. Math., 2018

Largest Components in Random Hypergraphs.
Comb. Probab. Comput., 2018

Finding Tight Hamilton Cycles in Random Hypergraphs Faster.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

An algorithmic framework for obtaining lower bounds for random Ramsey problems.
J. Comb. Theory B, 2017

Minimum rainbow H-decompositions of graphs.
Electron. Notes Discret. Math., 2017

Embedding spanning bounded degree subgraphs in randomly perturbed graphs.
Electron. Notes Discret. Math., 2017

Quasirandomness in hypergraphs.
Electron. Notes Discret. Math., 2017

Powers of Hamilton cycles in pseudorandom graphs.
Comb., 2017

Spanning structures and universality in sparse hypergraphs.
Random Struct. Algorithms, 2016

On the minimum degree of minimal Ramsey graphs for multiple colours.
J. Comb. Theory B, 2016

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

On the multicolor Ramsey number of a graph with m edges.
Discret. Math., 2016

Minimum Degrees and Codegrees of Ramsey-Minimal 3-Uniform Hypergraphs.
Comb. Probab. Comput., 2016

On Universal Hypergraphs.
Electron. J. Comb., 2016

Tight Hamilton cycles in random hypergraphs.
Random Struct. Algorithms, 2015

On Spanning Structures in Random Hypergraphs.
Electron. Notes Discret. Math., 2015

Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs.
Electron. Notes Discret. Math., 2015

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

On the rank of higher inclusion matrices.
J. Lond. Math. Soc., 2014

What is Ramsey-equivalent to a clique?
J. Comb. Theory B, 2014

An improved error term for minimum H-decompositions of graphs.
J. Comb. Theory B, 2014

Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs.
J. Graph Theory, 2013

A regularity lemma and twins in words.
J. Comb. Theory A, 2013

An approximate blow-up lemma for sparse pseudorandom graphs.
Electron. Notes Discret. Math., 2013

Weak quasi-randomness for uniform hypergraphs.
Random Struct. Algorithms, 2012

Minimum H-decompositions of graphs: Edge-critical case.
J. Comb. Theory B, 2012

On Even-Degree Subgraphs of Linear Hypergraphs.
Comb. Probab. Comput., 2012

Note on forcing pairs.
Electron. Notes Discret. Math., 2011

A Randomized Version of Ramsey's Theorem.
Electron. Notes Discret. Math., 2011

On Extremal Hypergraphs for Hamiltonian Cycles.
Electron. Notes Discret. Math., 2011

On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree.
SIAM J. Discret. Math., 2009

An expected polynomial time algorithm for coloring 2-colorable 3-graphs.
Electron. Notes Discret. Math., 2009

Note on strong refutation algorithms for random k-SAT formulas.
Electron. Notes Discret. Math., 2009

Highly connected coloured subgraphs via the regularity lemma.
Discret. Math., 2009

On Colourings of Hypergraphs Without Monochromatic Fano Planes.
Comb. Probab. Comput., 2009

Almost all hypergraphs without Fano planes are bipartite.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009