On limits of finite graphs
From MaRDI portal
Publication:950328
DOI10.1007/s00493-007-2214-8zbMath1164.05061arXivmath/0505335OpenAlexW2050692833MaRDI QIDQ950328
Publication date: 22 October 2008
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0505335
Related Items
First order convergence of matroids ⋮ Matchings on infinite graphs ⋮ From quasirandom graphs to graph limits and graphlets ⋮ A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth ⋮ Convergence of graphs with intermediate density ⋮ First-Order Convergence and Roots ⋮ KŐNIG’S LINE COLORING AND VIZING’S THEOREMS FOR GRAPHINGS ⋮ Asymptotic behavior and distributional limits of preferential attachment graphs ⋮ Hyperfinite graphings and combinatorial optimization ⋮ Finitely forcible graphons and permutons ⋮ Limits of locally-globally convergent graph sequences ⋮ The Ihara zeta function for infinite graphs ⋮ Weak convergence of finite graphs, integrated density of states and a Cheeger type inequality ⋮ Left and right convergence of graphs with bounded degree ⋮ An analytic approach to sparse hypergraphs: hypergraph removal ⋮ Finite graphs and amenability ⋮ Convergence theorems for graph sequences ⋮ Parameter testing in bounded degree graphs of subexponential growth ⋮ Resolvent of large random graphs ⋮ Flows on measurable spaces ⋮ EXISTENCE OF MODELING LIMITS FOR SEQUENCES OF SPARSE STRUCTURES ⋮ First order limits of sparse graphs: Plane trees and path-width ⋮ An infinite-dimensional metapopulation SIS model ⋮ Weak regularity and finitely forcible graph limits ⋮ Invariant Schreier decorations of unimodular random networks ⋮ Weighted enumeration of spanning subgraphs in locally tree-like graphs ⋮ Limits of random trees. II
Cites Work
