The Specker-Blatter theorem does not hold for quaternary relations

DOI10.1016/S0097-3165(03)00075-XzbMath1022.03016OpenAlexW1975241591MaRDI QIDQ1399912

Eldar Fischer

Publication date: 30 July 2003

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0097-3165(03)00075-x

zbMATH Keywords

relational structureslinear recurrence relationdefinability in first-order logicquaternary relationsultimately periodic

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Properties of classes of models (03C52) Interpolation, preservation, definability (03C40)

Related Items (5)

On the Tutte and Matching Polynomials for Complete Graphs ⋮ On spectra of sentences of monadic second order logic with counting ⋮ Remembering Ernst Specker (1920--2011) ⋮ Unnamed Item ⋮ Definability of Combinatorial Functions and Their Linear Recurrence Relations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Une théorie combinatoire des séries formelles
• The Specker-Blatter Theorem Revisited
• The Enumeration of Locally Restricted Graphs (I)
• The Enumeration of Locally Restricted Graphs (II)
• Binomial Coefficients Modulo a Prime

This page was built for publication: The Specker-Blatter theorem does not hold for quaternary relations