| Publication | Date of Publication | Type |
|---|
Erdős-Szekeres type theorems for ordered uniform matchings
Journal of Combinatorial Theory. Series B | 2024-12-12 | Paper |
A note on non-isomorphic edge-color classes in random graphs
Graphs and Combinatorics | 2024-12-09 | Paper |
The Erdős-Gyárfás function \(f(n, 4, 5) = \frac{5}{6} n + o(n)\) -- so Gyárfás was right
Journal of Combinatorial Theory. Series B | 2024-10-08 | Paper |
Ordered unavoidable sub-structures in matchings and random matchings
The Electronic Journal of Combinatorics | 2024-05-10 | Paper |
scientific article; zbMATH DE number 7771747 (Why is no real title available?)
| 2023-11-29 | Paper |
Long twins in random words
Annals of Combinatorics | 2023-11-15 | Paper |
Powers of Hamiltonian cycles in randomly augmented Dirac graphs—The complete collection
Journal of Graph Theory | 2023-11-06 | Paper |
High powers of Hamiltonian cycles in randomly augmented graphs
Journal of Graph Theory | 2023-10-04 | Paper |
Twins in ordered hyper-matchings
| 2023-10-02 | Paper |
Generalized Ramsey numbers at the linear and quadratic thresholds
| 2023-08-31 | Paper |
Patterns in ordered (random) matchings
LATIN 2022: Theoretical Informatics | 2023-07-26 | Paper |
Erd\H{o}s-Szekeres type Theorems for ordered uniform matchings
| 2023-01-07 | Paper |
A random coloring process gives improved bounds for the Erd\H{o}s-Gy\'arf\'as problem on generalized Ramsey numbers
| 2022-12-13 | Paper |
A note on non-isomorphic edge-color classes in random graphs
| 2022-10-05 | Paper |
A gentle introduction to the differential equation method and dynamic concentration
Discrete Mathematics | 2022-09-26 | Paper |
On weak twins and up-and-down subpermutations
Number Theory and Combinatorics | 2022-08-12 | Paper |
The Erd\H{o}s-Gy\'arf\'as function $f(n, 4, 5) = \frac 56 n + o(n)$ -- so Gy\'arf\'as was right
| 2022-07-06 | Paper |
On weak twins and up-and-down sub-permutations
| 2022-03-24 | Paper |
Localization game for random graphs
Discrete Applied Mathematics | 2022-01-13 | Paper |
Tight multiple twins in permutations
Annals of Combinatorics | 2021-12-18 | Paper |
Closing the random graph gap in Tuza's conjecture through the online triangle packing process
SIAM Journal on Discrete Mathematics | 2021-10-18 | Paper |
On the number of alternating paths in random graphs
Discrete Applied Mathematics | 2021-09-30 | Paper |
Hat chromatic number of graphs
Discrete Mathematics | 2021-09-30 | Paper |
Variations on twins in permutations
The Electronic Journal of Combinatorics | 2021-08-06 | Paper |
Large triangle packings and Tuza's conjecture in sparse random graphs
Combinatorics, Probability and Computing | 2021-04-30 | Paper |
An analogue of the Erdős-Gallai theorem for random graphs
European Journal of Combinatorics | 2021-02-08 | Paper |
Powers of Hamiltonian cycles in randomly augmented graphs
Random Structures \& Algorithms | 2020-06-19 | Paper |
Minimizing the number of 5-cycles in graphs with given edge-density
Combinatorics, Probability and Computing | 2020-04-06 | Paper |
Constructive Ramsey numbers for loose hyperpaths
| 2020-02-12 | Paper |
Monochromatic loose paths in multicolored $k$-uniform cliques
| 2020-01-13 | Paper |
A random variant of the game of plates and olives
SIAM Journal on Discrete Mathematics | 2019-08-29 | Paper |
A note on the localization number of random graphs: diameter two case
Discrete Applied Mathematics | 2019-02-08 | Paper |
Large monochromatic components and long monochromatic cycles in random hypergraphs
European Journal of Combinatorics | 2018-12-20 | Paper |
Note on the multicolour size-Ramsey number for paths
The Electronic Journal of Combinatorics | 2018-09-07 | Paper |
On rainbow Hamilton cycles in random hypergraphs
The Electronic Journal of Combinatorics | 2018-06-27 | Paper |
Size-Ramsey numbers of cycles versus a path
Discrete Mathematics | 2018-05-24 | Paper |
Randomly twisted hypercubes
European Journal of Combinatorics | 2018-04-25 | Paper |
On offset Hamilton cycles in random hypergraphs
Discrete Applied Mathematics | 2018-02-22 | Paper |
Adding random edges to create the square of a Hamilton cycle
| 2017-10-07 | Paper |
An alternative proof of the linearity of the size-Ramsey number of paths
Combinatorics, Probability and Computing | 2017-10-04 | Paper |
Loose Hamilton Cycles in Regular Hypergraphs
Combinatorics, Probability and Computing | 2017-10-04 | Paper |
On the size-Ramsey number of hypergraphs
Journal of Graph Theory | 2017-09-26 | Paper |
On some multicolor Ramsey properties of random graphs
SIAM Journal on Discrete Mathematics | 2017-09-18 | Paper |
On the number of alternating paths in bipartite complete graphs
Graphs and Combinatorics | 2017-08-10 | Paper |
On the Ramsey-Turán number with small \(s\)-independence number
Journal of Combinatorial Theory. Series B | 2016-11-25 | Paper |
Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity
Journal of Combinatorial Theory. Series B | 2016-11-25 | Paper |
Square of a Hamilton cycle in a random graph
| 2016-11-20 | Paper |
The set chromatic number of random graphs
Discrete Applied Mathematics | 2016-10-07 | Paper |
Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs
The Electronic Journal of Combinatorics | 2016-07-06 | Paper |
The total acquisition number of random graphs
The Electronic Journal of Combinatorics | 2016-07-06 | Paper |
Square of Hamilton cycle in a random graph
| 2016-06-24 | Paper |
The vertex size-Ramsey number
Discrete Mathematics | 2016-04-08 | Paper |
Acquaintance time of random graphs near connectivity threshold
SIAM Journal on Discrete Mathematics | 2016-04-07 | Paper |
Rainbow connection of random regular graphs
SIAM Journal on Discrete Mathematics | 2015-11-18 | Paper |
Maker-breaker games on random geometric graphs
Random Structures \& Algorithms | 2015-06-22 | Paper |
Extensions of results on rainbow Hamilton cycles in uniform hypergraphs
Graphs and Combinatorics | 2015-05-22 | Paper |
On generalized Ramsey numbers of Erdős and Rogers
Journal of Combinatorial Theory. Series B | 2014-10-22 | Paper |
A note on a Ramsey-type problem for sequences
The Electronic Journal of Combinatorics | 2014-09-30 | Paper |
The \(t\)-tone chromatic number of random graphs
Graphs and Combinatorics | 2014-09-19 | Paper |
Approximate counting of matchings in \((3,3)\)-hypergraphs
Algorithm Theory – SWAT 2014 | 2014-09-02 | Paper |
On generalized Ramsey numbers for 3-uniform hypergraphs
Journal of Graph Theory | 2014-08-07 | Paper |
scientific article; zbMATH DE number 6303032 (Why is no real title available?)
| 2014-06-11 | Paper |
Cops and robbers playing on edges
Journal of Combinatorics | 2014-04-30 | Paper |
Approximate counting of regular hypergraphs
Information Processing Letters | 2014-04-14 | Paper |
On the complexity of vertex-coloring edge-weightings
| 2014-03-25 | Paper |
On balanced colorings of sparse hypergraphs
Discrete Mathematics | 2014-03-07 | Paper |
Some recent results on Ramsey-type numbers
Discrete Applied Mathematics | 2013-11-29 | Paper |
On minimum saturated matrices
Graphs and Combinatorics | 2013-09-26 | Paper |
Optimal divisibility conditions for loose Hamilton cycles in random hypergraphs
The Electronic Journal of Combinatorics | 2013-06-07 | Paper |
Tight Hamilton cycles in random uniform hypergraphs
Random Structures \& Algorithms | 2013-05-28 | Paper |
Cops and robbers on geometric graphs
Combinatorics, Probability and Computing | 2012-10-31 | Paper |
Some remarks on vertex Folkman numbers for hypergraphs
Discrete Mathematics | 2012-09-12 | Paper |
On induced Folkman numbers
Random Structures \& Algorithms | 2012-08-14 | Paper |
Rainbow Hamilton cycles in uniform hypergraphs
The Electronic Journal of Combinatorics | 2012-06-12 | Paper |
On the size and structure of graphs with a constant number of 1-factors
Discrete Mathematics | 2012-05-30 | Paper |
On the maximum number of edges in a hypergraph with a unique perfect matching
Discrete Mathematics | 2012-04-13 | Paper |
On \(K_s\)-free subgraphs in \(K_{s+k}\)-free graphs and vertex Folkman numbers
Combinatorica | 2011-12-20 | Paper |
Vertex colorings of graphs without short odd cycles
Journal of Graph Theory | 2011-11-15 | Paper |
Flips in graphs
SIAM Journal on Discrete Mathematics | 2011-06-17 | Paper |
Loose Hamilton cycles in random uniform hypergraphs
The Electronic Journal of Combinatorics | 2011-06-01 | Paper |
On the Function of Erdős and Rogers
Ramsey Theory | 2010-12-20 | Paper |
On \(k\)-partite hypergraphs with the induced \(\epsilon \)-density property
Discrete Mathematics | 2010-05-05 | Paper |
Subhypergraph counts in extremal and random hypergraphs and the fractional \(q\)-independence
Journal of Combinatorial Optimization | 2010-04-26 | Paper |
A note on universal and canonically coloured sequences
Combinatorics, Probability and Computing | 2010-04-22 | Paper |
An almost quadratic bound on vertex Folkman numbers
Journal of Combinatorial Theory. Series B | 2010-04-21 | Paper |
On \(k\)-chromatically connected graphs
Discrete Mathematics | 2009-12-15 | Paper |
On the Turán properties of infinite graphs
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Cliques in Steiner systems
Mathematica Slovaca | 2009-02-09 | Paper |
On the Folkman Numberf(2, 3, 4)
Experimental Mathematics | 2008-12-18 | Paper |
Finding Folkman Numbers via MAX CUT Problem
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
New Upper Bound on Vertex Folkman Numbers
Lecture Notes in Computer Science | 2008-04-15 | Paper |
Planar Ramsey numbers for small graphs
| 2006-03-30 | Paper |
scientific article; zbMATH DE number 3545236 (Why is no real title available?)
| 1976-01-01 | Paper |
Largest bipartite sub-matchings of a random ordered matching or a problem with socks
| N/A | Paper |
