Abstract: We prove that for any weakly convergent sequence of finite graphs with bounded vertex degrees, there exists a topological limit graphing.
Cites work
Cited in
(39)- Weak convergence of finite graphs, integrated density of states and a Cheeger type inequality
- Limits of locally-globally convergent graph sequences
- Matchings on infinite graphs
- scientific article; zbMATH DE number 5044305 (Why is no real title available?)
- Hypergraph limits: A regularity approach
- Kőnig's line coloring and Vizing's theorems for graphings
- Finite graphs and amenability
- Resolvent of large random graphs
- From quasirandom graphs to graph limits and graphlets
- An undecidability result on limits of sparse graphs
- First-Order Convergence and Roots
- Limits of random trees. II
- Convergence theorems for graph sequences
- On the graph limit question of Vera T. Sós
- On the graph limit question of Vera T. Sós
- Convergence of graphs with intermediate density
- Left and right convergence of graphs with bounded degree
- Limits of iterated \(H\)-line graphs
- Flows on measurable spaces
- Weak regularity and finitely forcible graph limits
- First order convergence of matroids
- Weak regularity and finitely forcible graph limits
- Parameter testing in bounded degree graphs of subexponential growth
- An infinite-dimensional metapopulation SIS model
- Finitely forcible graphons and permutons
- Asymptotic behavior and distributional limits of preferential attachment graphs
- Weighted enumeration of spanning subgraphs in locally tree-like graphs
- A unified approach to structural limits and limits of graphs with bounded tree-depth
- The Ihara zeta function for infinite graphs
- An analytic approach to sparse hypergraphs: hypergraph removal
- Graphs of finite measure
- On The Existence of Restricted K-Limits
- Invariant Schreier decorations of unimodular random networks
- Non-standard limits of graphs and some orbit equivalence invariants
- A conjecture concerning a limit of non-Cayley graphs
- A limit law of almost \(l\)-partite graphs
- First order limits of sparse graphs: plane trees and path-width
- Existence of modeling limits for sequences of sparse structures
- Hyperfinite graphings and combinatorial optimization
This page was built for publication: On limits of finite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q950328)
