default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYury Person
Person information
- affiliation: Goethe University of Frankfurt, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j49]Max Hahn-Klimroth, Olaf Parczyk, Yury Person:
Minimum degree conditions for containing an r-regular r-connected spanning subgraph. Eur. J. Comb. 118: 103940 (2024)- 2023
- [j48]Alberto Espuny Díaz
, Yury Person:
Spanning -cycles in random graphs. Comb. Probab. Comput. 32(5): 833-850 (2023) - [j47]Elad Aigner-Horev, Yury Person:
An asymmetric random Rado theorem: 1-statement. J. Comb. Theory A 193: 105687 (2023) - 2022
- [j46]Elad Aigner-Horev, Yury Person:
On sparse random combinatorial matrices. Discret. Math. 345(11): 113017 (2022) - 2021
- [j45]Jie Han, Yoshiharu Kohayakawa, Yury Person:
Near-perfect clique-factors in sparse pseudorandom graphs. Comb. Probab. Comput. 30(4): 570-590 (2021) - [j44]Jie Han, Yoshiharu Kohayakawa, Patrick Morris, Yury Person:
Finding any given 2-factor in sparse pseudorandom graphs efficiently. J. Graph Theory 96(1): 87-108 (2021) - [i4]Max Hahn-Klimroth, Olaf Parczyk, Yury Person:
Minimum degree conditions for containing an r-regular r-connected subgraph. CoRR abs/2108.07601 (2021) - 2020
- [j43]Dennis Clemens, Julia Ehrenmüller, Yury Person:
A Dirac-type Theorem for Berge Cycles in Random Hypergraphs. Electron. J. Comb. 27(3): 3 (2020)
2010 – 2019
- 2019
- [j42]Jie Han, Yoshiharu Kohayakawa, Patrick Morris, Yury Person:
Clique-factors in sparse pseudorandom graphs. Eur. J. Comb. 82 (2019) - [j41]Julia Böttcher, Jie Han, Yoshiharu Kohayakawa, Richard Montgomery, Olaf Parczyk, Yury Person:
Universality for bounded degree spanning trees in randomly perturbed graphs. Random Struct. Algorithms 55(4): 854-864 (2019) - [j40]Elad Aigner-Horev, Yury Person:
Monochromatic Schur Triples in Randomly Perturbed Dense Sets of Integers. SIAM J. Discret. Math. 33(4): 2175-2180 (2019) - [i3]Jie Han, Yoshiharu Kohayakawa, Patrick Morris, Yury Person:
Finding any given 2-factor in sparse pseudorandom graphs efficiently. CoRR abs/1902.06164 (2019) - 2018
- [j39]Elad Aigner-Horev, David Conlon, Hiêp Hàn, Yury Person, Mathias Schacht:
Quasirandomness in Hypergraphs. Electron. J. Comb. 25(3): 3 (2018) - [j38]Oliver Cooley, Mihyun Kang, Yury Person:
Largest Components in Random Hypergraphs. Comb. Probab. Comput. 27(5): 741-762 (2018) - [j37]Lale Özkahya, Yury Person:
Minimum rainbow H-decompositions of graphs. Eur. J. Comb. 71: 111-124 (2018) - [j36]Jie Han, Yoshiharu Kohayakawa, Yury Person:
Near-perfect clique-factors in sparse pseudorandom graphs. Electron. Notes Discret. Math. 68: 221-226 (2018) - [c3]Peter Allen, Christoph Koch, Olaf Parczyk, Yury Person:
Finding Tight Hamilton Cycles in Random Hypergraphs Faster. LATIN 2018: 28-36 - 2017
- [j35]Peter Allen, Julia Böttcher, Hiêp Hàn, Yoshiharu Kohayakawa, Yury Person:
Powers of Hamilton cycles in pseudorandom graphs. Comb. 37(4): 573-616 (2017) - [j34]Elad Aigner-Horev, David Conlon, Hiêp Hàn, Yury Person, Mathias Schacht:
Quasirandomness in hypergraphs. Electron. Notes Discret. Math. 61: 13-19 (2017) - [j33]Julia Böttcher, Richard Montgomery, Olaf Parczyk, Yury Person:
Embedding spanning bounded degree subgraphs in randomly perturbed graphs. Electron. Notes Discret. Math. 61: 155-161 (2017) - [j32]Lale Özkahya, Yury Person:
Minimum rainbow H-decompositions of graphs. Electron. Notes Discret. Math. 61: 955-961 (2017) - [j31]Rajko Nenadov, Yury Person, Nemanja Skoric, Angelika Steger:
An algorithmic framework for obtaining lower bounds for random Ramsey problems. J. Comb. Theory B 124: 1-38 (2017) - [i2]Lale Özkahya, Yury Person:
Minimum Rainbow H-Decompositions of Graphs. CoRR abs/1704.01000 (2017) - 2016
- [j30]Samuel Hetterich, Olaf Parczyk, Yury Person:
On Universal Hypergraphs. Electron. J. Comb. 23(4): 4 (2016) - [j29]Dennis Clemens, Yury Person:
Minimum Degrees and Codegrees of Ramsey-Minimal 3-Uniform Hypergraphs. Comb. Probab. Comput. 25(6): 850-869 (2016) - [j28]Kathleen Johst, Yury Person:
On the multicolor Ramsey number of a graph with m edges. Discret. Math. 339(12): 2857-2860 (2016) - [j27]Dennis Clemens, Julia Ehrenmüller, Yury Person:
A Dirac-type theorem for Hamilton Berge cycles in random hypergraphs. Electron. Notes Discret. Math. 54: 181-186 (2016) - [j26]Jacob Fox, Andrey Grinshpun, Anita Liebenau, Yury Person, Tibor Szabó:
On the minimum degree of minimal Ramsey graphs for multiple colours. J. Comb. Theory B 120: 64-82 (2016) - [j25]Olaf Parczyk, Yury Person:
Spanning structures and universality in sparse hypergraphs. Random Struct. Algorithms 49(4): 819-844 (2016) - 2015
- [j24]Dennis Clemens, Julia Ehrenmüller, Yury Person, Tuan Tran:
Keeping Avoider's Graph Almost Acyclic. Electron. J. Comb. 22(1): 1 (2015) - [j23]Dennis Clemens, Yury Person:
Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs. Electron. Notes Discret. Math. 49: 23-30 (2015) - [j22]Olaf Parczyk, Yury Person:
On Spanning Structures in Random Hypergraphs. Electron. Notes Discret. Math. 49: 611-619 (2015) - [j21]Peter Allen, Julia Böttcher, Yoshiharu Kohayakawa, Yury Person:
Tight Hamilton cycles in random hypergraphs. Random Struct. Algorithms 46(3): 446-465 (2015) - 2014
- [j20]Peter Allen, Julia Böttcher, Yury Person:
An improved error term for minimum H-decompositions of graphs. J. Comb. Theory B 108: 92-101 (2014) - [j19]Jacob Fox, Andrey Grinshpun, Anita Liebenau, Yury Person, Tibor Szabó:
What is Ramsey-equivalent to a clique? J. Comb. Theory B 109: 120-133 (2014) - [j18]Codrut Grosu, Yury Person, Tibor Szabó:
On the rank of higher inclusion matrices. J. Lond. Math. Soc. 90(2): 333-349 (2014) - [c2]Peter Allen, Julia Böttcher, Hiêp Hàn, Yoshiharu Kohayakawa, Yury Person:
Powers of Hamilton Cycles in Pseudorandom Graphs. LATIN 2014: 355-366 - 2013
- [j17]Peter Allen, Julia Böttcher, Hiêp Hàn, Yoshiharu Kohayakawa, Yury Person:
An approximate blow-up lemma for sparse pseudorandom graphs. Electron. Notes Discret. Math. 44: 393-398 (2013) - [j16]Maria Axenovich, Yury Person, Svetlana Puzynina:
A regularity lemma and twins in words. J. Comb. Theory A 120(4): 733-743 (2013) - [j15]Hanno Lefmann, Yury Person:
Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs. J. Graph Theory 73(1): 1-31 (2013) - 2012
- [j14]Domingos Dellamonica Jr., Penny E. Haxell, Tomasz Luczak, Dhruv Mubayi, Brendan Nagle, Yury Person, Vojtech Rödl, Mathias Schacht, Jacques Verstraëte:
On Even-Degree Subgraphs of Linear Hypergraphs. Comb. Probab. Comput. 21(1-2): 113-127 (2012) - [j13]Roman Glebov, Yury Person, Wilma Weps:
On extremal hypergraphs for Hamiltonian cycles. Eur. J. Comb. 33(4): 544-555 (2012) - [j12]Lale Özkahya, Yury Person:
Minimum H-decompositions of graphs: Edge-critical case. J. Comb. Theory B 102(3): 715-725 (2012) - [j11]David Conlon, Hiêp Hàn, Yury Person, Mathias Schacht:
Weak quasi-randomness for uniform hypergraphs. Random Struct. Algorithms 40(1): 1-38 (2012) - [j10]Luca Gugelmann, Yury Person, Angelika Steger, Henning Thomas:
A randomized version of Ramsey's theorem. Random Struct. Algorithms 41(4): 488-505 (2012) - [i1]Maria Axenovich, Yury Person, Svetlana Puzynina:
A regularity lemma and twins in words. CoRR abs/1204.2180 (2012) - 2011
- [j9]Yury Person, Mathias Schacht:
An expected polynomial time algorithm for coloring 2-colorable 3-graphs. Discret. Math. Theor. Comput. Sci. 13(2): 1-18 (2011) - [j8]Roman Glebov, Yury Person, Wilma Weps:
On Extremal Hypergraphs for Hamiltonian Cycles. Electron. Notes Discret. Math. 38: 401-406 (2011) - [j7]Luca Gugelmann, Yury Person, Angelika Steger, Henning Thomas:
A Randomized Version of Ramsey's Theorem. Electron. Notes Discret. Math. 38: 431-436 (2011) - [j6]Hiêp Hàn, Yury Person, Mathias Schacht:
Note on forcing pairs. Electron. Notes Discret. Math. 38: 437-442 (2011)
2000 – 2009
- 2009
- [j5]Hanno Lefmann, Yury Person, Vojtech Rödl, Mathias Schacht:
On Colourings of Hypergraphs Without Monochromatic Fano Planes. Comb. Probab. Comput. 18(5): 803-818 (2009) - [j4]Henry Liu, Yury Person:
Highly connected coloured subgraphs via the regularity lemma. Discret. Math. 309(21): 6277-6287 (2009) - [j3]Yury Person, Mathias Schacht:
An expected polynomial time algorithm for coloring 2-colorable 3-graphs. Electron. Notes Discret. Math. 34: 465-469 (2009) - [j2]Hiêp Hàn, Yury Person, Mathias Schacht:
Note on strong refutation algorithms for random k-SAT formulas. Electron. Notes Discret. Math. 35: 157-162 (2009) - [j1]Hiêp Hàn, Yury Person, Mathias Schacht:
On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree. SIAM J. Discret. Math. 23(2): 732-748 (2009) - [c1]Yury Person, Mathias Schacht:
Almost all hypergraphs without Fano planes are bipartite. SODA 2009: 217-226
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-03 21:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
