1 problem

Bergold–Fabila-Monroy–Roldán-Pensado–Schaefer conjecture on empty cycles in simple drawings
Bergold–Fabila-Monroy–Roldán-Pensado–Schaefer conjecture. Every simple drawing of $K_n$ contains an empty $k$ -cycle for each $3 leq k leq n$ . The supplied paper proves the case…
Conjectureopenempty-polygons simple-drawings topological-graph-theory
0

Bergold–Fabila-Monroy–Roldán-Pensado–Schaefer conjecture on empty cycles in simple drawings