Operations with structures
From MaRDI portal
Publication:5561941
DOI10.1007/BF02280291zbMath0174.01401MaRDI QIDQ5561941
Publication date: 1967
Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)
Related Items
Strengthening topological colorful results for graphs, Perfect matchings, rank of connection tensors and graph homomorphisms, Structure and Power: an Emerging Landscape, In praise of homomorphisms, Four Shorts Stories on Surprising Algorithmic Uses of Treewidth, Approximately Counting H-Colourings is $$\#\mathrm {BIS}$$-Hard, Counting Homomorphisms to Square-Free Graphs, Modulo 2, Unnamed Item, Nonnegative Weighted #CSP: An Effective Complexity Dichotomy, Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings, Limits of dense graph sequences, Classification of a Class of Counting Problems Using Holographic Reductions, From Hom(A,X) Hom(B,X) to A B, Lattices arising in categorial investigations of Hedetniemi's conjecture, Algebras in permutable varieties: Geometrical properties of affine algebras, The Complexity of Boolean Holant Problems with Nonnegative Weights, Lov\'asz Meets Weisfeiler and Leman, Quasi-independence, homology and the unity of type: a topological theory of characters, Cancellation among finite unary algebras, Constructing cospectral graphs via a new form of graph product, The isomorphism problem for group algebras: a criterion, A dichotomy for bounded degree graph homomorphisms with nonnegative weights, Graphon convergence of random cographs, The contributions of Alfred Tarski to general algebra, Unnamed Item, Does the endomorphism poset $P^P$ determine whether a finite poset $P$ is connected? An issue Duffus raised in 1978, Quantum isomorphism of graphs from association schemes, Unnamed Item, Holographic algorithms beyond matchgates, Many Facets of Dualities, Reconcilable differences, Containment of conjunctive queries on annotated relations, Graph exponentiation and neighborhood reconstruction, Distinguishing graphs by their left and right homomorphism profiles, Progress in Complexity of Counting Problems, Double graphs, Finding the prime factors of strong direct product graphs in polynomial time, Monoid-labeled transition systems, A method for obtaining refinement theorems, with an application to direct products of semigroups, A characterization of cancellable k-ary structures, Powers of ordered sets, The rank of connection matrices and the dimension of graph algebras, The fine spectrum of a variety, Unnamed Item, Unnamed Item, On recognizing graphs by numbers of homomorphisms, Dichotomy for Holant\(^\ast\) problems on the Boolean domain, Approximately Counting $H$-Colorings is $\#\mathrm{BIS}$-Hard, The structure of locally finite varieties with polynomially many models, A Complete Dichotomy Rises from the Capture of Vanishing Signatures, The Complexity of Homomorphism Indistinguishability, Counting Answers to Existential Questions, The complexity of counting homomorphisms to cactus graphs modulo 2, On the cancellation law among finite relational structures, The Complexity of Counting Surjective Homomorphisms and Compactions, Categorial quasivarieties, Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices, A surprising permanence of old motivations (a not-so-rigid story), On a multiplicative graph function conjecture, Chromatic numbers and products, Counting Homomorphisms to Sparse Graphs, Polyadic sets and homomorphism counting, Fractional isomorphism of graphons, Duality theorems for finite structures (characterising gaps and good characterisations), Unique list-colourability and the fixing chromatic number of graphs, Density via duality., Discrete density comonads and graph parameters
Cites Work
