A semi-graph is like a graph (more precisely, an undirected, simple graph, possibly with loops) but where certain edges may be ‘open’ or ‘half-open’: they may have a vertex at only one end, or at neither end. As usual, edges can only be joined at vertices. A vertex is typically indicated by a solid dot (possibly with a label), an end of edge without a vertex is typically indicated by a hollow dot (never with a label).
Here is a quick example, which has one edge without any vertices, and two edges with only one vertex.
Throughout this page, we pick a set with exactly one element, and denote it .
The following definition follows Mochizuki2006.
A semi-graph consists of a set , a set whose elements are sets with exactly two elements, and, for every element of , a map .
Let be a semi-graph. A vertex of is an element of . An edge of is an element of . An edge of abuts to a vertex of if belongs to the image of . We refer to an element of an edge of as a branch of .
In particular, every edge of a semi-graph has exactly two branches, but it is possible that neither, both, or only one of the branches abuts a vertex. Thus we think of an edge as subdivided into two branches and , and do not think of the meeting point as a vertex of the graph; but always consider the other end of each branch as a vertex, either ‘closed’ (the branch maps to an actual vertex of under ) or ‘open’ (the branch maps to under ).
Last revised on April 17, 2020 at 06:24:09. See the history of this page for a list of all contributions to it.