3 problems

Simple-treewidth bend-number conjecture. For $k\geq 3$, the maximal bend-number of graphs satisfying

Three-path crossing conjecture. No three $k$-bend paths can pairwise cross in

Bend-number realization conjecture. For every positive integer $k$, there is a graph $G$ such that