No Finite-Infinite Antichain Duality in the Homomorphism Poset of Directed Graphs.
Péter L. ErdösLajos SoukupPublished in: Order (2010)
Keyphrases
- directed graph
- finite sets
- random walk
- partial order
- real numbers
- directed acyclic graph
- totally ordered
- linear programming
- finite dimensional
- partially ordered
- maximum flow
- graph structure
- strongly connected
- finite number
- partially ordered sets
- machine learning
- linearly separable
- unions of conjunctive queries
- disjoint paths
- random variables