NU polymorphisms on reflexive digraphs

DOI10.1137/16M110527XMaRDI QIDQ4610183zbMATH OpenOpenAlexWikidataFDO

Authors Benoît Larose, Mark Siggers

Publication date 6 April 2018

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/16m110527x

zbMATH Keywords

near-unanimity polymorphismposetsreflexive digraphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Structural characterization of families of graphs (05C75) Combinatorics of partially ordered sets (06A07) Equational logic, Mal'tsev conditions (08B05)

Recommendations

• Graphs admitting k-NU operations. II: The irreflexive case
• Graphs admitting \(k\)-NU operations. I: The reflexive case
• Reflexive graphs with near unanimity but no semilattice polymorphisms
• Reflexive digraphs with near unanimity polymorphisms
• Distributive lattice polymorphisms on reflexive graphs

Cites work

• A Characterisation of First-Order Constraint Satisfaction Problems
• A polynomial-time algorithm for near-unanimity graphs
• A structure theory for ordered sets
• Algebraic properties of crowns and fences
• Clones, order varieties, near unanimity functions and holes
• Dualities for Constraint Satisfaction Problems
• Graphs admitting \(k\)-NU operations. I: The reflexive case
• Graphs admitting k-NU operations. II: The irreflexive case
• Holes in ordered sets
• scientific article; zbMATH DE number 3962727 (Why is no real title available?)
• scientific article; zbMATH DE number 3972929 (Why is no real title available?)
• scientific article; zbMATH DE number 3198033 (Why is no real title available?)
• Injective envelope of graphs and transition systems
• List homomorphisms to reflexive graphs
• Near-Unanimity Functions and Varieties of Reflexive Graphs
• Near-Unanimity Polymorphisms on Structures with Finite Duality
• Order varieties generated by finite posets
• Posets, near unanimity functions and zigzags
• Reflexive digraphs with near unanimity polymorphisms
• Regular families of forests, antichains and duality pairs of relational structures
• Relational Sets and Categorical Equivalence of Algebras
• Short Answers to Exponentially Long Questions: Extremal Aspects of Homomorphism Duality
• The strong selection property and ordered sets of finite length

Cited in

(5)

• Graphs admitting k-NU operations. II: The irreflexive case
• Reflexive digraphs with near unanimity polymorphisms
• Algebra and the complexity of digraph CSPs: a survey
• Graphs admitting \(k\)-NU operations. I: The reflexive case
• Surjective polymorphisms of directed reflexive cycles

This page was built for publication: NU polymorphisms on reflexive digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4610183)