Nina Kamvcev

collaborators

4 papers

math.CO2026

The complete picture for clique factors in randomly perturbed graphs

Sylwia Antoniuk, Nina KamÄev, Christian Reiher +1

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

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_{I^} \pm \cup G (n, p)$ is obtained by taking a deterministic $n$ -vertex graph $G_{I^} \pm = (V, E)$ with minimum degree $I^´ (G) \geq I^\pm n$ and adding the edges of…

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.CO2024

Triangle-free graphs with diameter 2

Alice Devillers, Nina KamÄev, Brendan McKay +5

There are finitely many graphs with diameter $2$ and girth 5. What if the girth 5 assumption is relaxed? Apart from stars, are there finitely many triangle-free graphs with diamete…

The complete picture for clique factors in randomly perturbed graphs

Clique factors in randomly perturbed graphs: the transition points

When t-intersecting hypergraphs admit bounded c-strong colourings

Triangle-free graphs with diameter 2

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