Yury Person

According to our database1, Yury Person authored at least 41 papers between 2009 and 2018.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Near-perfect clique-factors in sparse pseudorandom graphs.
Electronic Notes in Discrete Mathematics, 2018

Minimum rainbow H-decompositions of graphs.
Eur. J. Comb., 2018

Largest Components in Random Hypergraphs.
Combinatorics, Probability & Computing, 2018

Quasirandomness in Hypergraphs.
Electr. J. Comb., 2018

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

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

Minimum rainbow H-decompositions of graphs.
Electronic Notes in Discrete Mathematics, 2017

Embedding spanning bounded degree subgraphs in randomly perturbed graphs.
Electronic Notes in Discrete Mathematics, 2017

Quasirandomness in hypergraphs.
Electronic Notes in Discrete Mathematics, 2017

2016
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, Ser. B, 2016

A Dirac-type theorem for Hamilton Berge cycles in random hypergraphs.
Electronic Notes in Discrete Mathematics, 2016

On the multicolor Ramsey number of a graph with m edges.
Discrete Mathematics, 2016

Minimum Degrees and Codegrees of Ramsey-Minimal 3-Uniform Hypergraphs.
Combinatorics, Probability & Computing, 2016

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

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

On Spanning Structures in Random Hypergraphs.
Electronic Notes in Discrete Mathematics, 2015

Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs.
Electronic Notes in Discrete Mathematics, 2015

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

2014
On the rank of higher inclusion matrices.
J. London Math. Society, 2014

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

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

Powers of Hamilton Cycles in Pseudorandom Graphs.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

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

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

An approximate blow-up lemma for sparse pseudorandom graphs.
Electronic Notes in Discrete Mathematics, 2013

2012
A randomized version of Ramsey's theorem.
Random Struct. Algorithms, 2012

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

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

On extremal hypergraphs for Hamiltonian cycles.
Eur. J. Comb., 2012

On Even-Degree Subgraphs of Linear Hypergraphs.
Combinatorics, Probability & Computing, 2012

2011
Note on forcing pairs.
Electronic Notes in Discrete Mathematics, 2011

A Randomized Version of Ramsey's Theorem.
Electronic Notes in Discrete Mathematics, 2011

On Extremal Hypergraphs for Hamiltonian Cycles.
Electronic Notes in Discrete Mathematics, 2011

An expected polynomial time algorithm for coloring 2-colorable 3-graphs.
Discrete Mathematics & Theoretical Computer Science, 2011

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

An expected polynomial time algorithm for coloring 2-colorable 3-graphs.
Electronic Notes in Discrete Mathematics, 2009

Note on strong refutation algorithms for random k-SAT formulas.
Electronic Notes in Discrete Mathematics, 2009

Highly connected coloured subgraphs via the regularity lemma.
Discrete Mathematics, 2009

On Colourings of Hypergraphs Without Monochromatic Fano Planes.
Combinatorics, Probability & Computing, 2009

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


  Loading...