default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRoman Glebov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j21]Shoni Gilboa, Roman Glebov, Dan Hefetz, Nati Linial, Avraham Morgenstern:
On the Local Structure of Oriented Graphs - a Case Study in Flag Algebras. Electron. J. Comb. 29(3) (2022)- 2021
- [j20]Roman Glebov, Zur Luria, Michael Simkin
:
Perfect matchings in random subgraphs of regular bipartite graphs. J. Graph Theory 97(2): 208-231 (2021)
2010 – 2019
- 2019
- [j19]Shagnik Das, Roman Glebov, Benny Sudakov, Tuan Tran:
Colouring set families without monochromatic k-chains. J. Comb. Theory A 168: 84-119 (2019) - 2018
- [j18]Gonzalo Fiz Pontiveros, Roman Glebov, Ilan Karpas:
Virtually Fibering Random Right-Angled Coxeter Groups - Extended Abstract. Electron. Notes Discret. Math. 68: 257-261 (2018) - 2017
- [j17]Roman Glebov, Humberto Naves, Benny Sudakov:
The Threshold Probability for Long Cycles. Comb. Probab. Comput. 26(2): 208-247 (2017) - [j16]Roman Glebov, Carlos Hoppen, Tereza Klimosová, Yoshiharu Kohayakawa, Daniel Král', Hong Liu:
Densities in large permutations and parameter testing. Eur. J. Comb. 60: 89-99 (2017) - 2016
- [j15]Roman Glebov, Zur Luria:
On the maximum number of Latin transversals. J. Comb. Theory A 141: 136-146 (2016) - 2015
- [j14]Roman Glebov, Andrzej Grzesik, Tereza Klimosová, Daniel Král:
Finitely forcible graphons and permutons. J. Comb. Theory B 110: 112-135 (2015) - [j13]Noga Alon, Shagnik Das, Roman Glebov, Benny Sudakov:
Comparable pairs in families of sets. J. Comb. Theory B 115: 164-185 (2015) - [j12]Asaf Ferber, Roman Glebov, Michael Krivelevich, Alon Naor:
Biased games on random boards. Random Struct. Algorithms 46(4): 651-676 (2015) - [j11]Roman Glebov, Anita Liebenau, Tibor Szabó:
On the Concentration of the Domination Number of the Random Graph. SIAM J. Discret. Math. 29(3): 1186-1206 (2015) - [j10]Dennis Clemens, Asaf Ferber, Roman Glebov, Dan Hefetz, Anita Liebenau:
Building Spanning Trees Quickly in Maker-Breaker Games. SIAM J. Discret. Math. 29(3): 1683-1705 (2015) - 2014
- [j9]Roman Glebov, Benny Sudakov, Tibor Szabó:
How Many Colors Guarantee a Rainbow Matching? Electron. J. Comb. 21(1): 1 (2014) - [j8]Roman Glebov, Tibor Szabó, Gábor Tardos:
Conflict-Free Colouring of Graphs. Comb. Probab. Comput. 23(3): 434-448 (2014) - [j7]Roman Glebov, Michael Krivelevich, Tibor Szabó:
On covering expander graphs by hamilton cycles. Random Struct. Algorithms 44(2): 183-200 (2014) - [i2]Roman Glebov, Tereza Klimosová, Daniel Král:
Infinite dimensional finitely forcible graphon. CoRR abs/1404.2743 (2014) - [i1]Roman Glebov, Carlos Hoppen, Tereza Klimosová, Yoshiharu Kohayakawa, Daniel Král, Hong Liu:
Large permutations and parameter testing. CoRR abs/1412.5622 (2014) - 2013
- [j6]Asaf Ferber, Roman Glebov, Michael Krivelevich, Hong Liu, Cory Palmer, Tomás Valla, Máté Vizer:
The Biased Odd Cycle Game. Electron. J. Comb. 20(2): 9 (2013) - [j5]Roman Glebov, Daniel Král', Jan Volec:
An application of flag algebras to a problem of Erdős and Sós. Electron. Notes Discret. Math. 43: 171-177 (2013) - [j4]Roman Glebov, Michael Krivelevich:
On the Number of Hamilton Cycles in Sparse Random Graphs. SIAM J. Discret. Math. 27(1): 27-42 (2013) - 2012
- [j3]Roman Glebov:
Bijective mapping preserving intersecting antichains for k-valued cubes. Discret. Math. 312(12-13): 2023-2026 (2012) - [j2]Roman Glebov, Yury Person, Wilma Weps:
On extremal hypergraphs for Hamiltonian cycles. Eur. J. Comb. 33(4): 544-555 (2012) - 2011
- [j1]Roman Glebov, Yury Person, Wilma Weps:
On Extremal Hypergraphs for Hamiltonian Cycles. Electron. Notes Discret. Math. 38: 401-406 (2011)
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-10-07 22:08 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:
