No finite-infinite antichain duality in the homomorphism poset of directed graphs

DOI10.1007/S11083-009-9118-8zbMath1223.05094OpenAlexW2055964929MaRDI QIDQ603883

Lajos Soukup, Péter L. Erdős

Publication date: 8 November 2010

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11083-009-9118-8

zbMATH Keywords

antichain dualityhomomorphism poset of directed graphs

Mathematics Subject Classification ID

Partial orders, general (06A06) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

On infinite-finite duality pairs of directed graphs ⋮ Regular families of forests, antichains and duality pairs of relational structures

Cites Work

• On classes of relations and graphs determined by subobjects and factorobjects
• Splitting property in infinite posets
• Universal partial order represented by means of oriented trees and other simple graphs
• Duality theorems for finite structures (characterising gaps and good characterisations)
• A splitting property of maximal antichains
• Generalised dualities and maximal finite antichains in the homomorphism order of relational structures
• How to split antichains in infinite posets
• On Finite Maximal Antichains in the Homomorphism Order
• Generalised Dualities and Finite Maximal Antichains
• Duality and Polynomial Testing of Tree Homomorphisms
• Finite paths are universal
• Unnamed Item
• Unnamed Item

This page was built for publication: No finite-infinite antichain duality in the homomorphism poset of directed graphs