7 problems

Let ${\mathcal H}$ be a non-trivial hereditary property of graphs, and call $p\in[0,1]$ an accumulation point when the edit-distance function of ${\mathcal H}$ is not locally deter…

Let ${\mathcal H}$ be a non-trivial hereditary property of graphs, and call $p\in[0,1]$ an accumulation point when the edit-distance function of ${\mathcal H}$ is not locally deter…

Let $\mathcal{H}$ be a non-trivial hereditary graph property, and let accumulation points mean limit points of its edit distance function. Half-interval conjecture. For any non-tri…

Let $\mathcal{H}$ be a non-trivial hereditary graph property, and call a point an accumulation point if it is a limit point of the edit distance function of $\mathcal{H}$. Finitene…

For positive integers $s$ and $t$, let $K_{s,t}$ be the complete bipartite graph with parts of sizes $s$ and $t$, and let $\operatorname{Forb}(K_{s,t})$ denote the hereditary prope…

Let $d4d8$ be a non-trivial hereditary property, and let $d4d2(d4d8)$ be the set of CRGs avoiding its forbidden graphs. For each $p a[0,1]$, let $gK(p)$ denote the quadratic minimi…

Finite CRG representation conjecture. For every nontrivial hereditary property $\mathcal{H}$ and every $\varepsilon>0$, the edit distance function…