O. Parczyk

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
The square of a Hamilton cycle in randomly perturbed graphs
(available as arXiv preprint)
N/APaper
The maximum diameter of 2-dimensional simplicial complexes
Discrete & Computational Geometry
2026-10-01Paper
An unsure note on an un-Schur problem
The Electronic Journal of Combinatorics
2026-03-20Paper
Dirac's theorem for graphs of bounded bandwidth
The Electronic Journal of Combinatorics
2026-02-04Paper
Spanning spheres in Dirac hypergraphs
Combinatorica
2025-12-08Paper
Cycle factors in randomly perturbed graphs
Procedia Computer Science
2025-12-02Paper
New Ramsey multiplicity bounds and search heuristics
Foundations of Computational Mathematics
2025-11-25Paper
New Ramsey multiplicity bounds and search heuristics2025-08-01Paper
On product Schur triples in the integers
SIAM Journal on Discrete Mathematics
2025-06-05Paper
A general approach to transversal versions of Dirac-type theorems (extended abstract)2025-04-15Paper
The size-Ramsey number of powers of bounded degree trees
Acta Mathematica Universitatis Comenianae. New Series
2024-10-18Paper
More non-bipartite forcing pairs
Acta Mathematica Universitatis Comenianae. New Series
2024-10-18Paper
Almost spanning universality in random graphs
Acta Mathematica Universitatis Comenianae. New Series
2024-10-18Paper
Resilience for tight Hamiltonicity
Combinatorial Theory
2024-10-08Paper
The square of a Hamilton cycle in randomly perturbed graphs
Random Structures & Algorithms
2024-09-02Paper
Minimum degree conditions for containing an \(r\)-regular \(r\)-connected spanning subgraph
European Journal of Combinatorics
2024-03-26Paper
A general approach to transversal versions of Dirac‐type theorems
Bulletin of the London Mathematical Society
2023-12-18Paper
On product Schur triples in the integers2023-11-30Paper
Triangles in randomly perturbed graphs
Combinatorics, Probability and Computing
2023-04-03Paper
The anti-Ramsey threshold of complete graphs
Discrete Mathematics
2023-03-10Paper
Graphs with large minimum degree and no small odd cycles are 3-colourable2023-02-03Paper
Anti-Ramsey threshold of cycles
Discrete Applied Mathematics
2022-11-02Paper
Near-Optimal Sparsity-Constrained Group Testing: Improved Bounds and Algorithms
IEEE Transactions on Information Theory
2022-07-13Paper
New Ramsey Multiplicity Bounds and Search Heuristics2022-06-08Paper
Anti-Ramsey threshold of cycles for sparse graphs2022-04-27Paper
Maker-Breaker games on randomly perturbed graphs
SIAM Journal on Discrete Mathematics
2021-12-01Paper
The size-Ramsey number of 3-uniform tight paths
Advances in Combinatorics
2021-11-05Paper
The size-Ramsey number of powers of bounded degree trees
Journal of the London Mathematical Society
2021-08-13Paper
Random perturbation of sparse graphs
The Electronic Journal of Combinatorics
2021-06-07Paper
Resilience for tight Hamiltonicity2021-05-10Paper
Cycle factors in randomly perturbed graphs2021-03-10Paper
Semi-random graph process
Random Structures & Algorithms
2020-06-19Paper
EMBEDDING SPANNING BOUNDED DEGREE GRAPHS IN RANDOMLY PERTURBED GRAPHS
Mathematika
2020-06-09Paper
2-universality in randomly perturbed graphs
European Journal of Combinatorics
2020-05-11Paper
Universality for bounded degree spanning trees in randomly perturbed graphs
Random Structures & Algorithms
2020-02-14Paper
More non-bipartite forcing pairs2019-06-10Paper
The anti-Ramsey threshold of complete graphs
(available as arXiv preprint)
2019-02-01Paper
Embedding spanning bounded degree subgraphs in randomly perturbed graphs
(available as arXiv preprint)
2018-01-18Paper
Embedding spanning bounded degree subgraphs in randomly perturbed graphs2018-01-18Paper
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
On spanning structures in random hypergraphs2016-10-14Paper


Research outcomes over time


This page was built for person: O. Parczyk