Nina Kamčev

collaborators

3 papers

math.CO2024

Clique factors in randomly perturbed graphs: the transition points

Sylwia Antoniuk, Nina Kamčev, Christian Reiher

A randomly perturbed graph $G^{p} = G_{α} \cup G (n, p)$ is obtained by taking a deterministic $n$ -vertex graph $G_{α} = (V, E)$ with minimum degree $δ (G) \geq α n$ and adding the edges of the…

math.CO2024

When $t$ -intersecting hypergraphs admit bounded $c$ -strong colourings

Kevin Hendrey, Freddie Illingworth, Nina Kamčev +1

The $c$ -strong chromatic number of a hypergraph is the smallest number of colours needed to colour its vertices so that every edge sees at least $c$ colours or is rainbow. We show…

math.CO2023

Universal lower bound for community structure of sparse graphs

Vilhelm Agdur, Nina Kamčev, Fiona Skerman

We prove new lower bounds on the modularity of graphs. Specifically, the modularity of a graph $G$ with average degree $d ˉ$ is $Ω (d ˉ^{- 1/2})$ , under some mild assumptions…

Clique factors in randomly perturbed graphs: the transition points

When t-intersecting hypergraphs admit bounded c-strong colourings

Universal lower bound for community structure of sparse graphs

When $t$ -intersecting hypergraphs admit bounded $c$ -strong colourings