Connection matrices and the definability of graph parameters

DOI10.2168/LMCS-10(4:1)2014MaRDI QIDQ2929592zbMATH OpenOpenAlexFDO

Authors Tomer Kotek, Johann A. Makowsky

Publication date 13 November 2014

Published in Logical Methods in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

finite model theorygraph invariants

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Logic with extra quantifiers and operators (03C80) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

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.

Recommendations

• Connection matrices and the definability of graph parameters
• Connection Matrices for MSOL-Definable Structural Invariants
• Finiteness conditions for graph algebras over tropical semirings
• Vertex-minors, monadic second-order logic, and a conjecture by Seese
• Connection matrices

Cited in

(12)

• The connectivity of the interchange graph of class \({\mathfrak A}(R,S)\) of (0,1)-matrices
• A logician's view of graph polynomials
• Recognizable series on graphs and hypergraphs
• Logics of finite Hankel rank
• Connection Matrices for MSOL-Definable Structural Invariants
• Finiteness conditions for graph algebras over tropical semirings
• Connection matrices and the definability of graph parameters
• Counting problems in parameterized complexity
• Harary polynomials
• MC-finiteness of restricted set partition functions
• On the complexity of generalized chromatic polynomials
• My writing

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)