Emil Powierski

From MaRDI portal
(Redirected from Emil Powierski)



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
On the largest common subtree of uniform attachment trees
(available as arXiv preprint)
2026-01-01Paper
A framework for the generalised Erdős-Rothschild problem and a resolution of the dichromatic triangle case
(available as arXiv preprint)
2025-01-01Paper
A local limit theorem for the edge counts of random induced subgraphs of a random graph
(available as arXiv preprint)
2025-01-01Paper
Reconstructing a point set from a random subset of its pairwise distances
SIAM Journal on Discrete Mathematics
2024-11-05Paper
A note on interval colourings of graphs
European Journal of Combinatorics
2024-07-08Paper
Induced subgraphs of induced subgraphs of large chromatic number
Combinatorica
2024-04-09Paper
Invertibility of Digraphs and Tournaments
SIAM Journal on Discrete Mathematics
2024-01-23Paper
Counting partitions of Gn,1/2$$ {G}_{n,1/2} $$ with degree congruence conditions
Random Structures & Algorithms
2023-10-19Paper
Balancing connected colourings of graphs
The Electronic Journal of Combinatorics
2023-04-19Paper
A note on interval colourings of graphs2023-03-08Paper
Reconstructing a point set from a random subset of its pairwise distances2023-01-26Paper
Balancing connected colourings of graphs
(available as arXiv preprint)
2022-05-10Paper
A Note on Infinite Antichain Density
SIAM Journal on Discrete Mathematics
2022-03-15Paper
Ramsey properties of randomly perturbed dense graphs2019-02-06Paper
Ramsey properties of randomly perturbed dense graphs
(available as arXiv preprint)
2019-01-01Paper


Research outcomes over time


This page was built for person: Emil Powierski