HOME PAGE

Lattice Graph Intro.   P1 Prototype,   P2 Terminal Model,   P3 Bureaucratic Model,   P4 Committee Model

Significant labels:

NOTE: All graphs G on N² satisfy max(x)>max(y) for any edge (x,y). We refer to such graphs as downward.  We call the function t_D discussed above as the terminal labeling function for D.

Remarks:  The terminal lattice-exit theorem is valid if N² is replaced by N^k , E² is replaced by E^k , and 2² is replaced by k^k (the proof is essentially the same).

Proof of Theorem (terminal lattice-exit) PDF

Proof of Theorem (terminal lattice-exit) GIF

Proof of Theorem (terminal lattice-exit) JPG

(Reference(1) p7) and (Reference(2) pp6-8) give alternative discussions.

Return: Lattice Graph Introduction

 HOME PAGE