7 citations · 7 across the 6 of their papers we have counts for
6 papers
The complete picture for clique factors in randomly perturbed graphs
Sylwia Antoniuk, Nina Kamčev, Christian Reiher +1
A randomly perturbed graph is obtained by taking a deterministic -vertex graph with minimum degree and adding the edges of th…
Clique factors in randomly perturbed graphs: the transition points
Sylwia Antoniuk, Nina Kamčev, Christian Reiher
A randomly perturbed graph is obtained by taking a deterministic -vertex graph with minimum degree and adding the edges of the…
When -intersecting hypergraphs admit bounded -strong colourings
Kevin Hendrey, Freddie Illingworth, Nina Kamčev +1
The -strong chromatic number of a hypergraph is the smallest number of colours needed to colour its vertices so that every edge sees at least colours or is rainbow. We show…
Triangle-free graphs with diameter 2
Alice Devillers, Nina Kamčev, Brendan McKay +5
There are finitely many graphs with diameter and girth 5. What if the girth 5 assumption is relaxed? Apart from stars, are there finitely many triangle-free graphs with diamete…
Towards a characterisation of Sidorenko systems
Nina Kamčev, Anita Liebenau, Natasha Morrison
A system of linear forms over is said to be Sidorenko if the number of solutions to in any is asymptotica…
Generalised Knight's Tours
Nina Kamčev
The problem of existence of closed knight's tours in , where , was recently solved by Erde, Golénia, and Golénia. They raised the same question for…