Hard enumeration problems in geometry and combinatorics
SIAM Journal on Algebraic and Discrete Methods
Complexity: knots, colourings and counting
Complexity: knots, colourings and counting
The complexity of harmonious colouring for trees
Discrete Applied Mathematics - Special issue: Combinatorial Optimization 1992 (CO92)
Upper bounds to the clique width of graphs
Discrete Applied Mathematics
Discrete Applied Mathematics - Special issue on international workshop of graph-theoretic concepts in computer science WG'98 conference selected papers
Uniform definability on finite structures with successor
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
The interlace polynomial of a graph
Journal of Combinatorial Theory Series B - Special issue dedicated to professor W. T. Tutte
Efficient approximation of convex recolorings
Journal of Computer and System Sciences
Some new evaluations of the Tutte polynomial
Journal of Combinatorial Theory Series B
Parity, eulerian subgraphs and the Tutte polynomial
Journal of Combinatorial Theory Series B
On Counting Generalized Colorings
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
From a Zoo to a Zoology: Towards a General Theory of Graph Polynomials
Theory of Computing Systems
Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Approximating rank-width and clique-width quickly
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.00 |
Connection matrices of graph parameters were first introduced by M. Freedman, L. Lovász and A. Schrijver (2007) to study the question which graph parameters can be represented as counting functions of weighted homomorphisms. The rows and columns of a connection matrix $M(f,\Box)$ of a graph parameter f and a binary operation $\Box$ are indexed by all finite (labeled) graphs Gi and the entry at (Gi ,Gj ) is given by the value of $f(Gi \Box Gj )$. Connection matrices turned out to be a very powerful tool for studying graph parameters in general. B. Godlin, T. Kotek and J.A. Makowsky (2008) noticed that connection matrices can be defined for general relational structures and binary operations between them, and for general structural parameters. They proved that for structural parameters f definable in Monadic Second Order Logic, (MSOL ) and binary operations compatible with MSOL , the connection matrix $M(f,\Box)$ has always finite rank. In this talk we discuss several applications of this Finite Rank Theorem, and outline ideas for further research.