Lattices in graphs with polynomial growth

DOI10.1016/S0012-365X(97)00194-5zbMath0958.05113OpenAlexW2062123715MaRDI QIDQ1584272

Norbert Seifter, András Lukács

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00194-5

zbMATH Keywords

polynomial growthpercolationCayley graphslattice graphisoperimetric properties

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Vertex-transitive median graphs of non-exponential growth ⋮ Finite contractions of graphs with polynomial growth

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on bounded automorphisms of infinite graphs
• Properties of graphs with polynomial growth
• Counting lattice points in pyramids
• AUTOMORPHISMS OF GRAPHS AND A CHARACTERIZATION OF LATTICES
• On the Markov Chain Simulation Method for Uniform Combinatorial Distributions and Simulated Annealing
• GRAPHS WITH POLYNOMIAL GROWTH
• A Survey on Spectra of infinite Graphs
• On Local Expansion of Vertex-Transitive Graphs
• Local Expansion of Symmetrical Graphs
• Isoperimetric Inequalities and Decay of Iterated Kernels for Almost-transitive Markov Chains

This page was built for publication: Lattices in graphs with polynomial growth