Maximal digraphs with respect to primitive positive constructability

DOI10.1007/S00493-022-4918-1MaRDI QIDQ6969991zbMATH OpenFDO

Authors Manuel Bodirsky, Florian Starke

Publication date 19 June 2025

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00493-022-4918-1

zbMATH Keywords

constructibility.submaximal digraphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Cites work

• \( \omega \)-categorical structures avoiding height 1 identities
• \(n\)-permutability and linear Datalog implies symmetric Datalog
• A dichotomy theorem for nonuniform CSPs
• A finer reduction of constraint problems to digraphs
• A proof of the CSP dichotomy conjecture
• Complexity and polymorphisms for digraph constraint problems under some basic constructions
• Cores and compactness of infinite directed graphs
• Cores of Countably Categorical Structures
• Duality theorems for finite structures (characterising gaps and good characterisations)
• scientific article; zbMATH DE number 2117181 (Why is no real title available?)
• Linear Datalog and Bounded Path Duality of Relational Structures
• On Maltsev digraphs
• On the complexity of H-coloring
• Smooth digraphs modulo primitive positive constructability and cyclic loop conditions
• The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
• The wonderland of reflections
• Two-element structures modulo primitive positive constructability

Cited in

(3)

• The generic circular triangle-free graph
• Symmetric linear arc monadic Datalog and gadget reductions
• Symmetric linear arc monadic Datalog and gadget reductions

This page was built for publication: Maximal digraphs with respect to primitive positive constructability

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