Proof of fundamental domain in a graph I am reading "Groups, Graphs and Trees" by John Meier and can't quite understand the proof of Lemma 1.52. More specifically, let's focus on the hexagonal example he gives. He also says something like "If there are only finitely many orbits of vertices and the graph is locally finite, then in the sequence there will be a maximal subgraph satisfying the conditions above". Why is this true?
In the hexagonal example, those condition hold but I don't see why we should have a maximal subgraph. Suppose we start with one of the outer vertices and then go along one of the outer edges. Suppose that we go along $1/4$ in length, then another $1/8$ and so on. So we get a chain of subgraphs but there is no maximal one and I also don't see how to obtain the CORE from here.
Could someone please clarify this part about how CORE is constructed? Thanks a lot!
EDIT: Here's the excerpt from the book 

 A: 
Suppose that we go along 1/4 in length, then another 1/8 and so on. So we get a chain of subgraphs but there is no maximal one and I also don't see how to obtain the CORE from here.

What you are describing is not a subgraph it is just a union of edge segments. Graphs are made up of edges and vertices, you don't include partial edges. Note that fundamental domains are closed and the union of what you describe won't be closed, it would be something like $[0,1)$.
How do you construct a CORE in the hexagon, $\Gamma$, example? First just choose any vertex, say the center one, as a subgraph and call it $C_0$. It satisfies the properties outlined in the beginning of the proof if $v$ is the center vertex. $C_1$ will be some graph subgraph which contains $C_0$ (the vertex) properly, is connected, and satisfies condition (2). In this case extend by any edge (so a single "spoke"). This turns out to be CORE since there are only two orbits of vertices and $C_1$ contains both (it contains two vertices) so adding any more vertices will contradict (2) and there is no way to add more edges without adding vertices (between any two, not necessarily distinct, vertices there is at most one edge).

He also says something like "If there are only finitely many orbits of vertices and the graph is locally finite, then in the sequence there will be a maximal subgraph satisfying the conditions above".

The finite orbit of vertices puts an upperbound on the number of vertices you can have so any increasing chain, if you are adding vertices, will stop at some point. The local finite condition basically says that you can't have an infinite increasing chain where you are only adding edges between some finite collection of vertices. That gives that some $C_n$ will be a maximal subgraph satisfying (1) and (2).
