Nikola Yolov

most citedRecognition of unipolar and generalised split graphs

1 citations · 1 across the 3 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2016

Blocker size via matching minors

Nikola Yolov

Finding the maximum number of maximal independent sets in an $n$ -vertex graph $G$ , $i (G)$ , from a restricted class is an extensively studied problem. Let $k K_{2}$ denote the matching…

math.CO2016

Hamilton cycles, minimum degree and bipartite holes

Colin McDiarmid, Nikola Yolov

We present a tight extremal threshold for the existence of Hamilton cycles in graphs with large minimum degree and without a large ``bipartite hole`` (two disjoint sets of vertices…

math.CO2016

Random Perfect Graphs

Colin McDiarmid, Nikola Yolov

We investigate the asymptotic structure of a random perfect graph $P_{n}$ sampled uniformly from the perfect graphs on vertex set ${1, \dots, n}$ . Our approach is based on the resul…