5 problems

Converse-invariance conjecture. If

Sullivan's conjecture. Every oriented graph contains at least one vertex $v$ such that

Approximate Seymour conjecture. For every $\epsilon>0$, every oriented graph $G$ has at least one vertex $v$ satisfying

Seymour's second neighbourhood conjecture. Every orientation $G$ contains at least one vertex $v$ such that

Let $k$ be a positive integer. For a graph $G$ and a vertex $x\in V(G)$, let $N_G(x)$ be the neighbourhood of $x$, and let $N_G^2(x)$ be the set of vertices other than $x$ sharing…