Cutsets in Infinite Graphs
From MaRDI portal
Publication:3429746
DOI10.1017/S0963548306007838zbMath1170.05033arXiv0711.1711MaRDI QIDQ3429746
Publication date: 20 March 2007
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0711.1711
05C80: Random graphs (graph-theoretic aspects)
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
05C40: Connectivity
Related Items
Boundary-connectivity via graph theory, Nonuniqueness and mean-field criticality for percolation on nonunimodular transitive graphs, Metric dimensions of minor excluded graphs and minor exclusion in groups, Connectedness of spheres in Cayley graphs, Triangulations of uniform subquadratic growth are quasi-trees, Analyticity Results in Bernoulli Percolation, On the cluster size distribution for percolation on some general graphs, Accessibility in transitive graphs, Percolation on infinite graphs and isoperimetric inequalities, Existence of phase transition for percolation using the Gaussian free field