Yury Person

57 papers A* 1B 2Journal 54
YearRankTypeTitle / Venue / Authors
2025 J jnl
Some Results on Fractional vs. Expectation Thresholds.
Electron. J. Comb.
Thomas Fischer, Yury Person
2024 J jnl
Minimum degree conditions for containing an r-regular r-connected spanning subgraph.
Eur. J. Comb.
Max Hahn-Klimroth, Olaf Parczyk, Yury Person
2023 J jnl
An asymmetric random Rado theorem: 1-statement.
J. Comb. Theory A
Elad Aigner-Horev, Yury Person
2023 J jnl
Spanning -cycles in random graphs.
Comb. Probab. Comput.
Alberto Espuny Díaz, Yury Person
2022 J jnl
On sparse random combinatorial matrices.
Discret. Math.
Elad Aigner-Horev, Yury Person
2021 J jnl
Finding any given 2-factor in sparse pseudorandom graphs efficiently.
J. Graph Theory
Jie Han, Yoshiharu Kohayakawa, Patrick Morris, Yury Person
2021 J jnl
Minimum degree conditions for containing an r-regular r-connected subgraph.
CoRR
Max Hahn-Klimroth, Olaf Parczyk, Yury Person
2021 J jnl
Near-perfect clique-factors in sparse pseudorandom graphs.
Comb. Probab. Comput.
Jie Han, Yoshiharu Kohayakawa, Yury Person
2020 J jnl
A Dirac-type Theorem for Berge Cycles in Random Hypergraphs.
Electron. J. Comb.
Dennis Clemens, Julia Ehrenmüller, Yury Person
2019 J jnl
Clique-factors in sparse pseudorandom graphs.
Eur. J. Comb.
Jie Han, Yoshiharu Kohayakawa, Patrick Morris, Yury Person
2019 J jnl
Finding any given 2-factor in sparse pseudorandom graphs efficiently.
CoRR
Jie Han, Yoshiharu Kohayakawa, Patrick Morris, Yury Person
2019 J jnl
Monochromatic Schur Triples in Randomly Perturbed Dense Sets of Integers.
SIAM J. Discret. Math.
Elad Aigner-Horev, Yury Person
2019 J jnl
Universality for bounded degree spanning trees in randomly perturbed graphs.
Random Struct. Algorithms
Julia Böttcher, Jie Han, Yoshiharu Kohayakawa, Richard Montgomery, Olaf Parczyk, Yury Person
2018 B conf
Finding Tight Hamilton Cycles in Random Hypergraphs Faster.
LATIN
Peter Allen, Christoph Koch, Olaf Parczyk, Yury Person
2018 J jnl
Largest Components in Random Hypergraphs.
Comb. Probab. Comput.
Oliver Cooley, Mihyun Kang, Yury Person
2018 J jnl
Minimum rainbow H-decompositions of graphs.
Eur. J. Comb.
Lale özkahya, Yury Person
2018 J jnl
Near-perfect clique-factors in sparse pseudorandom graphs.
Electron. Notes Discret. Math.
Jie Han, Yoshiharu Kohayakawa, Yury Person
2018 J jnl
Quasirandomness in Hypergraphs.
Electron. J. Comb.
Elad Aigner-Horev, David Conlon, Hiêp Hàn, Yury Person, Mathias Schacht
2017 J jnl
An algorithmic framework for obtaining lower bounds for random Ramsey problems.
J. Comb. Theory B
Rajko Nenadov, Yury Person, Nemanja Skoric, Angelika Steger
2017 J jnl
Embedding spanning bounded degree subgraphs in randomly perturbed graphs.
Electron. Notes Discret. Math.
Julia Böttcher, Richard Montgomery, Olaf Parczyk, Yury Person
2017 J jnl
Minimum Rainbow H-Decompositions of Graphs.
CoRR
Lale özkahya, Yury Person
2017 J jnl
Minimum rainbow H-decompositions of graphs.
Electron. Notes Discret. Math.
Lale özkahya, Yury Person
2017 J jnl
Powers of Hamilton cycles in pseudorandom graphs.
Comb.
Peter Allen, Julia Böttcher, Hiêp Hàn, Yoshiharu Kohayakawa, Yury Person
2017 J jnl
Quasirandomness in hypergraphs.
Electron. Notes Discret. Math.
Elad Aigner-Horev, David Conlon, Hiêp Hàn, Yury Person, Mathias Schacht
2016 J jnl
A Dirac-type theorem for Hamilton Berge cycles in random hypergraphs.
Electron. Notes Discret. Math.
Dennis Clemens, Julia Ehrenmüller, Yury Person
2016 J jnl
Minimum Degrees and Codegrees of Ramsey-Minimal 3-Uniform Hypergraphs.
Comb. Probab. Comput.
Dennis Clemens, Yury Person
2016 J jnl
On Universal Hypergraphs.
Electron. J. Comb.
Samuel Hetterich, Olaf Parczyk, Yury Person
2016 J jnl
On the minimum degree of minimal Ramsey graphs for multiple colours.
J. Comb. Theory B
Jacob Fox, Andrey Grinshpun, Anita Liebenau, Yury Person, Tibor Szabó
2016 J jnl
On the multicolor Ramsey number of a graph with m edges.
Discret. Math.
Kathleen Johst, Yury Person
2016 J jnl
Spanning structures and universality in sparse hypergraphs.
Random Struct. Algorithms
Olaf Parczyk, Yury Person
2015 J jnl
Keeping Avoider's Graph Almost Acyclic.
Electron. J. Comb.
Dennis Clemens, Julia Ehrenmüller, Yury Person, Tuan Tran
2015 J jnl
Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs.
Electron. Notes Discret. Math.
Dennis Clemens, Yury Person
2015 J jnl
On Spanning Structures in Random Hypergraphs.
Electron. Notes Discret. Math.
Olaf Parczyk, Yury Person
2015 J jnl
Tight Hamilton cycles in random hypergraphs.
Random Struct. Algorithms
Peter Allen, Julia Böttcher, Yoshiharu Kohayakawa, Yury Person
2014 J jnl
An improved error term for minimum H-decompositions of graphs.
J. Comb. Theory B
Peter Allen, Julia Böttcher, Yury Person
2014 J jnl
On the rank of higher inclusion matrices.
J. Lond. Math. Soc.
Codrut Grosu, Yury Person, Tibor Szabó
2014 B conf
Powers of Hamilton Cycles in Pseudorandom Graphs.
LATIN
Peter Allen, Julia Böttcher, Hiêp Hàn, Yoshiharu Kohayakawa, Yury Person
2014 J jnl
What is Ramsey-equivalent to a clique?
J. Comb. Theory B
Jacob Fox, Andrey Grinshpun, Anita Liebenau, Yury Person, Tibor Szabó
2013 J jnl
A regularity lemma and twins in words.
J. Comb. Theory A
Maria Axenovich, Yury Person, Svetlana Puzynina
2013 J jnl
An approximate blow-up lemma for sparse pseudorandom graphs.
Electron. Notes Discret. Math.
Peter Allen, Julia Böttcher, Hiêp Hàn, Yoshiharu Kohayakawa, Yury Person
2013 J jnl
Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs.
J. Graph Theory
Hanno Lefmann, Yury Person
2012 J jnl
A randomized version of Ramsey's theorem.
Random Struct. Algorithms
Luca Gugelmann, Yury Person, Angelika Steger, Henning Thomas
2012 J jnl
A regularity lemma and twins in words
CoRR
Maria Axenovich, Yury Person, Svetlana Puzynina
2012 J jnl
Minimum H-decompositions of graphs: Edge-critical case.
J. Comb. Theory B
Lale özkahya, Yury Person
2012 J jnl
On Even-Degree Subgraphs of Linear Hypergraphs.
Comb. Probab. Comput.
Domingos Dellamonica Jr., Penny E. Haxell, Tomasz Luczak, Dhruv Mubayi, Brendan Nagle, Yury Person, Vojtech Rödl, Mathias Schacht, Jacques Verstraëte
2012 J jnl
On extremal hypergraphs for Hamiltonian cycles.
Eur. J. Comb.
Roman Glebov, Yury Person, Wilma Weps
2012 J jnl
Weak quasi-randomness for uniform hypergraphs.
Random Struct. Algorithms
David Conlon, Hiêp Hàn, Yury Person, Mathias Schacht
2011 J jnl
A Randomized Version of Ramsey's Theorem.
Electron. Notes Discret. Math.
Luca Gugelmann, Yury Person, Angelika Steger, Henning Thomas
2011 J jnl
An expected polynomial time algorithm for coloring 2-colorable 3-graphs.
Discret. Math. Theor. Comput. Sci.
Yury Person, Mathias Schacht
2011 J jnl
Note on forcing pairs.
Electron. Notes Discret. Math.
Hiêp Hàn, Yury Person, Mathias Schacht
2011 J jnl
On Extremal Hypergraphs for Hamiltonian Cycles.
Electron. Notes Discret. Math.
Roman Glebov, Yury Person, Wilma Weps
2009 A* conf
Almost all hypergraphs without Fano planes are bipartite.
SODA
Yury Person, Mathias Schacht
2009 J jnl
An expected polynomial time algorithm for coloring 2-colorable 3-graphs.
Electron. Notes Discret. Math.
Yury Person, Mathias Schacht
2009 J jnl
Highly connected coloured subgraphs via the regularity lemma.
Discret. Math.
Henry Liu, Yury Person
2009 J jnl
Note on strong refutation algorithms for random k-SAT formulas.
Electron. Notes Discret. Math.
Hiêp Hàn, Yury Person, Mathias Schacht
2009 J jnl
On Colourings of Hypergraphs Without Monochromatic Fano Planes.
Comb. Probab. Comput.
Hanno Lefmann, Yury Person, Vojtech Rödl, Mathias Schacht
2009 J jnl
On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree.
SIAM J. Discret. Math.
Hiêp Hàn, Yury Person, Mathias Schacht