Abstract:
We generalise to the setting of 3-graphs a combinatorial
analogue of the Jordan curve theorem due to Stahl [9, 10]. More specifically,
using combinatorial techniques only, we give a graph theoretic
version of the theorem that the first Betti number of a surface is the
largest number of closed curves that can be drawn on the surface without
dividing it into two or more regions.