
AbstractWe investigate homomorphisms between finite oriented paths. We demonstrate the surprising richness of this perhaps simplest case of homomorphism between graphs by proving the density theorem for oriented paths. As a consequence every two dimensional countable poset is represented finite paths and their homomorphisms, and every finite dimensional poset is represented finite oriented trees and their homomorphisms. We then consider related problems of universal representability and extendability and on-line representability.
Graph theory, Combinatorics of partially ordered sets, homomorphism, paths, countable poset, trees, Paths and cycles
Graph theory, Combinatorics of partially ordered sets, homomorphism, paths, countable poset, trees, Paths and cycles
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 14 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
