14.02.2013 Views

Gruber P. Convex and Discrete Geometry

Gruber P. Convex and Discrete Geometry

Gruber P. Convex and Discrete Geometry

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Di+1<br />

34 Koebe’s Representation Theorem for Planar Graphs 503<br />

vi+1<br />

Di<br />

vi vi−1<br />

αi<br />

Di−1<br />

D∞<br />

Fig. 34.3. Country circle <strong>and</strong> vertex circles<br />

is open. Let w be one of its points. Then there are points x, y ∈ C 2 , x �= y,<br />

with f (x) = f (y) = w. Choose disjoint neighbourhoods U of x <strong>and</strong> V of y<br />

<strong>and</strong> a neighbourhood W of w such that f maps each of U, V homeomorphically<br />

onto W . Then, clearly, W ⊆ � z : # f −1 (z) ≥ 2 � . Secondly, it will be shown that<br />

the set � z : # f −1 (z) = 1 � is also open. For suppose not. Then there are points<br />

z, zn, n = 1, 2,..., with zn → z <strong>and</strong> # f −1 (z) = 1, # f −1 (zn) ≥ 2 for all n.<br />

Let {x} = f −1 (z) <strong>and</strong> choose neighbourhoods U of x <strong>and</strong> W of z such that f<br />

maps U homeomorphically onto W . By omitting finitely many indices <strong>and</strong> renumbering,<br />

if necessary, we may assume that there are xn ∈ U, yn ∈ C\U such that<br />

f (xn) = f (yn) = zn <strong>and</strong> xn → x. Since � y : # f −1� f (y) � ≥ 2 � is bounded by<br />

assumption, by considering a suitable subsequence <strong>and</strong> renumbering, if necessary,<br />

we may assume that yn → y ∈ C\U, say. The continuity of f then implies that<br />

f (x) = f (y) = z, while x �= y. This is a contradiction. C is thus the disjoint union<br />

of the two open sets � z : # f −1 (z) ≥ 2 � <strong>and</strong> � z : # f −1 (z) = 1 � . By assumption,<br />

� z : # f −1 (z) ≥ 2 � is bounded. Thus � z : # f −1 (z) = 1 � �=∅. Since C is connected,<br />

it follows that � z : # f −1 (z) ≥ 2 � =∅. Hence f is one-to-one, concluding the proof<br />

of (2).<br />

The third step is to show the following topological result on graphs.<br />

(3) Let H be the image of G ′ in C under a (graph) isomorphism f , possibly<br />

with edge crossings, which has the following properties:<br />

(i) All edges of H are polygonal arcs.<br />

(ii) For each vertex v of G ′ the images in H of the edges that leave v are<br />

pairwise non-crossing <strong>and</strong> leave f (v) in the same clockwise order as<br />

their originals in G ′ .<br />

(iii) The image of each country cycle in G ′ is a closed Jordan curve in H.<br />

(iv) If C is the boundary cycle of a bounded country of G ′ <strong>and</strong> E an edge<br />

of G ′ leaving C, then the first segment of f (E) is in the exterior of<br />

f (C).

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!