Yury Demidovich

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2023

Reconstruction of graph colourings

Yury Demidovich, Yaroslav Panichkin, Maksim Zhukovskii

A $k$ -deck of a (coloured) graph is a multiset of its induced $k$ -vertex subgraphs. Given a graph $G$ , when is it possible to reconstruct with high probability a uniformly random c…

math.CO2021

Cycle saturation in random graphs

Yury Demidovich, Arkadiy Skorkin, Maksim Zhukovskii

For a fixed graph $F,$ the minimum number of edges in an edge-maximal $F$ -free subgraph of $G$ is called the $F$ -saturation number. The asymptotics of the $F$ -saturation number of…