Yury Person

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!

PublicationDate of PublicationType
Spanning \(F\)-cycles in random graphs
Combinatorics, Probability and Computing
2024-11-05Paper
More non-bipartite forcing pairs
Acta Mathematica Universitatis Comenianae. New Series
2024-10-18Paper
Minimum degree conditions for containing an \(r\)-regular \(r\)-connected spanning subgraph
European Journal of Combinatorics
2024-03-26Paper
Some results on fractional vs. expectation thresholds2023-11-14Paper
Finding any given 2‐factor in sparse pseudorandom graphs efficiently
Journal of Graph Theory
2023-09-29Paper
Near-perfect clique-factors in sparse pseudorandom graphs
Combinatorics, Probability and Computing
2023-03-30Paper
An asymmetric random Rado theorem: 1-statement
Journal of Combinatorial Theory. Series A
2022-10-14Paper
On sparse random combinatorial matrices
Discrete Mathematics
2022-08-24Paper
Spanning $F$-cycles in random graphs2021-06-18Paper
A Dirac-type theorem for Berge cycles in random hypergraphs
The Electronic Journal of Combinatorics
2020-08-25Paper
EMBEDDING SPANNING BOUNDED DEGREE GRAPHS IN RANDOMLY PERTURBED GRAPHS
Mathematika
2020-06-09Paper
Universality for bounded degree spanning trees in randomly perturbed graphs
Random Structures & Algorithms
2020-02-14Paper
Monochromatic Schur Triples in Randomly Perturbed Dense Sets of Integers
SIAM Journal on Discrete Mathematics
2019-11-15Paper
Clique-factors in sparse pseudorandom graphs
European Journal of Combinatorics
2019-08-30Paper
More non-bipartite forcing pairs2019-06-10Paper
Almost all hypergraphs without Fano planes are bipartite2019-05-06Paper
Finding any given 2-factor in sparse pseudorandom graphs efficiently2019-02-16Paper
Largest components in random hypergraphs
Combinatorics, Probability and Computing
2018-11-05Paper
An algorithmic framework for obtaining lower bounds for random Ramsey problems
Journal of Combinatorial Theory. Series B
2018-10-29Paper
Near-perfect clique-factors in sparse pseudorandom graphs
(available as arXiv preprint)
2018-10-11Paper
Quasirandomness in hypergraphs
The Electronic Journal of Combinatorics
2018-09-07Paper
Quasirandomness in hypergraphs
The Electronic Journal of Combinatorics
2018-09-07Paper
Minimum rainbow \(H\)-decompositions of graphs
European Journal of Combinatorics
2018-05-18Paper
Quasirandomness in hypergraphs
Electronic Notes in Discrete Mathematics
2018-01-18Paper
Embedding spanning bounded degree subgraphs in randomly perturbed graphs2018-01-18Paper
Embedding spanning bounded degree subgraphs in randomly perturbed graphs
(available as arXiv preprint)
2018-01-18Paper
Minimum rainbow \(H\)-decompositions of graphs
Electronic Notes in Discrete Mathematics
2018-01-18Paper
Symmetric and asymmetric Ramsey properties in random hypergraphs
Forum of Mathematics, Sigma
2017-12-06Paper
Making spanning graphs2017-11-14Paper
Minimum degrees and codegrees of Ramsey-minimal 3-uniform hypergraphs
Combinatorics, Probability and Computing
2017-10-10Paper
A Dirac-type theorem for Hamilton Berge cycles in random hypergraphs
(available as arXiv preprint)
2017-02-13Paper
Spanning structures and universality in sparse hypergraphs
Random Structures & Algorithms
2017-01-05Paper
On universal hypergraphs
The Electronic Journal of Combinatorics
2016-12-06Paper
On universal hypergraphs
The Electronic Journal of Combinatorics
2016-12-06Paper
Blow-up lemmas for sparse graphs2016-12-02Paper
Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs
(available as arXiv preprint)
2016-10-14Paper
On spanning structures in random hypergraphs2016-10-14Paper
A sharp threshold for van der Waerden's theorem in random subsets
Discrete Analysis
2016-10-10Paper
On the multicolor Ramsey number of a graph with \(m\) edges
Discrete Mathematics
2016-08-16Paper
On the minimum degree of minimal Ramsey graphs for multiple colours
Journal of Combinatorial Theory. Series B
2016-06-03Paper
What is Ramsey-equivalent to a clique?
Journal of Combinatorial Theory. Series B
2014-10-22Paper
On the rank of higher inclusion matrices
Journal of the London Mathematical Society. Second Series
2014-10-15Paper
scientific article; zbMATH DE number 6273781 (Why is no real title available?)2014-03-25Paper
A randomized version of Ramsey's theorem2013-11-01Paper
On extremal hypergraphs for Hamiltonian cycles2013-11-01Paper
Note on forcing pairs2013-11-01Paper
An expected polynomial time algorithm for coloring 2-colorable 3-graphs
Electronic Notes in Discrete Mathematics
2013-10-10Paper
Note on strong refutation algorithms for random \(k\)-SAT formulas
Electronic Notes in Discrete Mathematics
2013-07-19Paper
Tree-minimal graphs are almost regular
Journal of Combinatorics
2013-07-12Paper
Exact results on the number of restricted edge colorings for some families of linear hypergraphs
Journal of Graph Theory
2013-05-21Paper
A regularity lemma and twins in words
Journal of Combinatorial Theory. Series A
2013-04-15Paper
A randomized version of Ramsey's theorem
Random Structures & Algorithms
2012-12-14Paper
On even-degree subgraphs of linear hypergraphs
Combinatorics, Probability and Computing
2012-05-14Paper
Minimum \(H\)-decompositions of graphs: edge-critical case
Journal of Combinatorial Theory. Series B
2012-05-11Paper
On extremal hypergraphs for Hamiltonian cycles
European Journal of Combinatorics
2012-05-04Paper
Weak quasi-randomness for uniform hypergraphs
Random Structures & Algorithms
2012-03-07Paper
A structural result for hypergraphs with many restricted edge colorings
Journal of Combinatorics
2011-06-27Paper
On perfect matchings in uniform hypergraphs with large minimum vertex degree
SIAM Journal on Discrete Mathematics
2010-06-01Paper
On colourings of hypergraphs without monochromatic Fano planes
Combinatorics, Probability and Computing
2010-04-22Paper


Research outcomes over time


This page was built for person: Yury Person