4 problems

For a positive integer $s$, a graph is $K_{s,s}$-free if it contains no subgraph isomorphic to $K_{s,s}$. Linear pivot-minor degree-boundedness conjecture. For each bipartite graph…

An odd subdivision of a graph $G$ is a graph obtained from $G$ by replacing each edge by a path of odd length. For a positive integer $s$, a graph is $K_{s,s}$-free if it contains…

Restricted antidirected subdivision conjecture. Every oriented graph $D$ with

A graph class $\mathcal{F}$ is proper if some graph is not isomorphic to any graph in $\mathcal{F}$. Write $\int(\mathcal{F})$ for the class of intersection graphs of collections of…