Lattice exit models
From MaRDI portal
Publication:6286867
Abstract: We discuss a class of problems which we call lattice exit models. At one level, these problems provide undergraduate level exercises in labeling the vertices of graphs (e.g., depth first search). At another level (theorems about large scale regularities of labels) they provide concrete geometric examples of ZFC independence. We note some combinatorial and algorithmic implications.
This page was built for publication: Lattice exit models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6286867)
