Roman Glebov
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Degree conditions forcing oriented cycles Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
| Perfect matchings in random subgraphs of regular bipartite graphs Journal of Graph Theory | 2023-09-29 | Paper |
| On the local structure of oriented graphs -- a case study in flag algebras The Electronic Journal of Combinatorics | 2022-09-06 | Paper |
| Compactness and finite forcibility of graphons Journal of the European Mathematical Society (JEMS) | 2019-10-15 | Paper |
| Infinite-dimensional finitely forcible graphon Proceedings of the London Mathematical Society | 2019-05-15 | Paper |
| Infinite-dimensional finitely forcible graphon Proceedings of the London Mathematical Society | 2019-05-15 | Paper |
| Virtually fibering random right-angled Coxeter groups -- extended abstract | 2018-10-11 | Paper |
| The number of Hamiltonian decompositions of regular graphs Israel Journal of Mathematics | 2017-12-21 | Paper |
| The threshold probability for long cycles Combinatorics, Probability and Computing | 2017-10-10 | Paper |
| Virtually fibering random right-angled Coxeter groups | 2017-03-03 | Paper |
| Densities in large permutations and parameter testing European Journal of Combinatorics | 2016-11-07 | Paper |
| Densities of 3-vertex graphs | 2016-10-07 | Paper |
| A problem of Erdős and Sós on 3-graphs Israel Journal of Mathematics | 2016-04-21 | Paper |
| On the maximum number of Latin transversals Journal of Combinatorial Theory. Series A | 2016-04-20 | Paper |
| Building spanning trees quickly in maker-breaker games SIAM Journal on Discrete Mathematics | 2015-09-23 | Paper |
| Building spanning trees quickly in maker-breaker games SIAM Journal on Discrete Mathematics | 2015-09-23 | Paper |
| Comparable pairs in families of sets Journal of Combinatorial Theory. Series B | 2015-08-21 | Paper |
| On the concentration of the domination number of the random graph SIAM Journal on Discrete Mathematics | 2015-07-31 | Paper |
| Biased games on random boards Random Structures & Algorithms | 2015-07-23 | Paper |
| Finitely forcible graphons and permutons Journal of Combinatorial Theory. Series B | 2014-11-21 | Paper |
| How many colors guarantee a rainbow matching? The Electronic Journal of Combinatorics | 2014-09-04 | Paper |
| How many colors guarantee a rainbow matching? The Electronic Journal of Combinatorics | 2014-09-04 | Paper |
| scientific article; zbMATH DE number 6303013 (Why is no real title available?) | 2014-06-11 | Paper |
| A problem of Erdős and Sós on 3-graphs The Seventh European Conference on Combinatorics, Graph Theory and Applications | 2014-06-11 | Paper |
| Conflict-free colouring of graphs Combinatorics, Probability and Computing | 2014-05-28 | Paper |
| On covering expander graphs by Hamilton cycles Random Structures & Algorithms | 2014-04-15 | Paper |
| On extremal hypergraphs for Hamiltonian cycles | 2013-11-01 | Paper |
| On the Number of Hamilton Cycles in Sparse Random Graphs SIAM Journal on Discrete Mathematics | 2013-06-27 | Paper |
| The biased odd cycle game The Electronic Journal of Combinatorics | 2013-06-07 | Paper |
| The biased odd cycle game The Electronic Journal of Combinatorics | 2013-06-07 | Paper |
| Bijective mapping preserving intersecting antichains for \(k\)-valued cubes Discrete Mathematics | 2012-06-18 | Paper |
| On extremal hypergraphs for Hamiltonian cycles European Journal of Combinatorics | 2012-05-04 | Paper |
| Extremal graphs for clique-paths | 2011-11-29 | Paper |
Research outcomes over time
This page was built for person: Roman Glebov
