First order limits of sparse graphs: Plane trees and path-width

DOI10.1002/rsa.20676zbMath1368.05088arXiv1504.08122OpenAlexW1759318922MaRDI QIDQ4978432

Petr Hliněný, Jan Obdržálek, Sebastian Ordyniak, Vojtěch Tůma, Tomáš Kaiser, Jakub Gajarský, Martin Kupec, Daniel Král'

Publication date: 10 August 2017

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.08122

zbMATH Keywords

graph limitsfirst order logicfirst order limitsgraphs with bounded path-width

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Density (toughness, etc.) (05C42)

Related Items (4)

A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth ⋮ Approximations of Mappings ⋮ EXISTENCE OF MODELING LIMITS FOR SEQUENCES OF SPARSE STRUCTURES ⋮ Local-global convergence, an analytic and structural approach

Cites Work

• Unnamed Item
• Sparsity. Graphs, structures, and algorithms
• Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
• Testing properties of graphs and functions
• Limits of dense graph sequences
• On limits of finite graphs
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• Limits of locally-globally convergent graph sequences
• Processes on unimodular random networks
• Sparse graphs: Metrics and random models
• Convergent sequences of sparse graphs: A large deviations approach

This page was built for publication: First order limits of sparse graphs: Plane trees and path-width