NewEvery arXiv paper, its researchers & institutions — mapped.
papers

Publications (25)

math.CO2018

Monochromatic Schur triples in randomly perturbed dense sets of integers

Elad Aigner-Horev, Yury Person

math.CO2016

On universal hypergraphs

Samuel Hetterich, Olaf Parczyk, Yury Person

math.CO2015

Spanning structures and universality in sparse hypergraphs

Olaf Parczyk, Yury Person

math.CO2015

On the minimum degree of minimal Ramsey graphs for multiple colours

Jacob Fox, Andrey Grinshpun, Anita Liebenau +2

math.CO2019

An Asymmetric Random Rado Theorem: 1-statement

Elad Aigner-Horev, Yury Person

math.CO2014

An algorithmic framework for obtaining lower bounds for random Ramsey problems

Rajko Nenadov, Yury Person, Nemanja Škorić +1

math.CO2019

A Dirac-type theorem for Berge cycles in random hypergraphs

Dennis Clemens, Julia Ehrenmüller, Yury Person

math.CO2016

Symmetric and asymmetric Ramsey properties in random hypergraphs

Luca Gugelmann, Rajko Nenadov, Yury Person +3

math.CO2011

An improved error term for minimum H-decompositions of graphs

Peter Allen, Julia Böttcher, Yury Person

math.CO2018

Near-perfect clique-factors in sparse pseudorandom graphs

Jie Han, Yoshiharu Kohayakawa, Yury Person

math.CO2017

Making spanning graphs

Peter Allen, Julia Böttcher, Yoshiharu Kohayakawa +2

math.CO2014

Largest components in random hypergraphs

Oliver Cooley, Mihyun Kang, Yury Person

math.CO2019

More non-bipartite forcing pairs

Tamas Hubai, Dan Kral, Olaf Parczyk +1

math.CO2013

Tight Hamilton cycles in random hypergraphs

Peter Allen, Julia Böttcher, Yoshiharu Kohayakawa +1

math.CO2013

What is Ramsey-equivalent to a clique?

Jacob Fox, Andrey Grinshpun, Anita Liebenau +2

math.CO2014

Keeping Avoider's graph almost acyclic

Dennis Clemens, Julia Ehrenmüller, Yury Person +1

math.CO2012

A regularity lemma and twins in words

Maria Axenovich, Yury Person, Svetlana Puzynina

math.CO2019

Embedding spanning bounded degree graphs in randomly perturbed graphs

Julia Böttcher, Richard Montgomery, Olaf Parczyk +1

The paper develops an absorption-based method for embedding spanning bounded-degree graphs and powers of Hamilton cycles into randomly perturbed dense graphs, showing that these em…

#randomly perturbed graphs#spanning subgraph embedding#bounded degree graphs#Hamilton cycle powers
math.CO2013

On the multicolor Ramsey number of a graph with m edges

Kathleen Johst, Yury Person

math.CO2011

On extremal hypergraphs for hamiltonian cycles

Roman Glebov, Yury Person, Wilma Weps

math.CO2017

Minimum Rainbow $H$-Decompositions of Graphs

Lale Özkahya, Yury Person

math.CO2019

Universality for bounded degree spanning trees in randomly perturbed graphs

Julia Böttcher, Jie Han, Yoshiharu Kohayakawa +3

math.CO2015

Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs

Dennis Clemens, Yury Person

math.CO2013

On the rank of higher inclusion matrices

Codrut Grosu, Yury Person, Tibor Szabo

math.CO2014

Powers of Hamilton cycles in pseudorandom graphs

Peter Allen, Julia Böttcher, Hiep Hà n +2