First order convergence of matroids
From MaRDI portal
Publication:326662
DOI10.1016/j.ejc.2016.08.005zbMath1348.05049arXiv1501.06518OpenAlexW2963336690WikidataQ57601312 ScholiaQ57601312MaRDI QIDQ326662
Anita Liebenau, Lukáš Mach, František Kardoš, Daniel Král'
Publication date: 12 October 2016
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.06518
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items (7)
Limits of mappings ⋮ A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth ⋮ Pathwidth vs Cocircumference ⋮ Branch-depth: generalizing tree-depth of graphs ⋮ Obstructions for Bounded Branch-depth in Matroids ⋮ EXISTENCE OF MODELING LIMITS FOR SEQUENCES OF SPARSE STRUCTURES ⋮ Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming
Cites Work
- Unnamed Item
- Unnamed Item
- Axioms for infinite matroids
- Sparsity. Graphs, structures, and algorithms
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- A measure-theoretic approach to the theory of dense hypergraphs
- Testing properties of graphs and functions
- Limits of dense graph sequences
- Testing branch-width
- On limits of finite graphs
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Recognizing graphic matroids
- Unavoidable minors of graphs of large type
- Recurrence of distributional limits of finite planar graphs
- Limits of permutation sequences
- Quasirandom permutations are characterized by 4-point densities
- Poset limits and exchangeable random posets
- Limits of locally-globally convergent graph sequences
- Processes on unimodular random networks
- Branch-width, parse trees, and monadic second-order logic for matroids.
- Deciding First Order Properties of Matroids
- An Algorithm for Determining Whether a Given Binary Matroid is Graphic
- Computing Representations of Matroids of Bounded Branch-Width
- The computational complexity of matroid properties
- Left and right convergence of graphs with bounded degree
- Sparse graphs: Metrics and random models
- Poset limits can be totally ordered
- A Parametrized Algorithm for Matroid Branch-Width
- On Matroid Representability and Minor Problems
This page was built for publication: First order convergence of matroids
