An Archimedean lattice is a graph of a regular tiling of the plane, such that all corners are equivalent. A tiling is regular if all tiles are regular polygons: equilateral triangles, squares, et cetera. There exist exactly 11 Archimedean lattices. Being planar graphs, the Archimedean lattices have duals, 3 of which are Archimedean, the other 8 are called Laves lattices.
In the thesis, three measures of connectivity of these 19 graphs are studied: the connective constant for self-avoiding walks, and bond and site percolation critical probabilities. The connective constant measures connectivity by the number of walks in which all visited vertices are unique. The critical probabilities quantify the proportion of edges or vertices that can be removed, so that the produced subgraph has a large connected component.
A common issue for these measures is that they, although intensely studied by both mathematicians and scientists from other fields, have been calculated only for very few graphs. With the goal of comparing the induced orders of the Archimedean and Laves lattices under the three measures, the thesis gives improved bounds and estimates for many graphs.
A large part of the thesis focuses on the problem of deciding whether a given graph is a subgraph of another graph. This, surprisingly difficult problem, is considered for the set of Archimedean and Laves lattices, and for the set of matching Archimedean and Laves lattices.