Connection matrices and the definability of graph parameters
From MaRDI portal
Publication:2929592
DOI10.2168/LMCS-10(4:1)2014zbMATH Open1345.03054arXiv1308.3654OpenAlexW1662963207MaRDI QIDQ2929592FDOQ2929592
Authors: Tomer Kotek, Johann A. Makowsky 
Publication date: 13 November 2014
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Abstract: In this paper we extend and prove in detail the Finite Rank Theorem for connection matrices of graph parameters definable in Monadic Second Order Logic with counting (CMSOL) from B. Godlin, T. Kotek and J.A. Makowsky (2008) and J.A. Makowsky (2009). We demonstrate its vast applicability in simplifying known and new non-definability results of graph properties and finding new non-definability results for graph parameters. We also prove a Feferman-Vaught Theorem for the logic CFOL, First Order Logic with the modular counting quantifiers.
Full work available at URL: https://arxiv.org/abs/1308.3654
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Model theory of finite structures (03C13) Logic with extra quantifiers and operators (03C80)
Cited In (11)
- Harary polynomials
- Finiteness conditions for graph algebras over tropical semirings
- Counting problems in parameterized complexity
- The connectivity of the interchange graph of class \({\mathfrak A}(R,S)\) of (0,1)-matrices
- MC-finiteness of restricted set partition functions
- A logician's view of graph polynomials
- Logics of finite Hankel rank
- Connection Matrices for MSOL-Definable Structural Invariants
- Connection matrices and the definability of graph parameters
- Recognizable series on graphs and hypergraphs
- On the complexity of generalized chromatic polynomials
This page was built for publication: Connection matrices and the definability of graph parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2929592)
