1 problem

Let $g\in\mathbb{N}$. An intersection graph of lines in $\mathbb{R}^3$ has one vertex for each line and edges joining intersecting lines; its girth is the length of its shortest cy…