Finite paths are universal (Q5920532): Difference between revisions

The authors prove that, in general, any countable partially ordered set can be represented by finite oriented paths ordered by the existence of homomorphisms between them. This generalizes an analogous result that was known only for partial orders of dimension 2.

0 references

reviewed by

Jiří Rachůnek

0 references

zbMATH Keywords

partially ordered set

0 references

oriented path

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s11083-005-9005-x

0 references

cites work

Automorphism groups of graphs and edge-contraction

0 references

Endomorphism monoids and topological subgraphs of graphs

0 references

The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments

0 references

On universal partly ordered sets and classes

0 references

Duality and Polynomial Testing of Tree Homomorphisms

0 references

Groups and Monoids of Regular Graphs (And of Graphs with Bounded Degrees)

0 references

On locally presented posets

0 references

Q4003410

0 references

Universal partial order represented by means of oriented trees and other simple graphs

0 references

Q4004146

0 references

Path homomorphisms

0 references

Q3208855

0 references

Countable homogeneous partially ordered sets

0 references

Identifiers

zbMATH Open document ID

1092.06002

0 references

DOI

10.1007/s11083-005-9005-x

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

journals/order/HubickaN05

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5920532

@@ Property / cites work @@
+Automorphism groups of graphs and edge-contraction
+Normal rank
@@ Property / cites work @@
+Endomorphism monoids and topological subgraphs of graphs
+Normal rank
@@ Property / cites work @@
+The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments
+Normal rank
@@ Property / cites work @@
+On universal partly ordered sets and classes
@@ Property / cites work: On universal partly ordered sets and classes / rank @@
+Normal rank
@@ Property / cites work @@
+Duality and Polynomial Testing of Tree Homomorphisms
+Normal rank
@@ Property / cites work @@
+Groups and Monoids of Regular Graphs (And of Graphs with Bounded Degrees)
+Normal rank
@@ Property / cites work @@
+On locally presented posets
@@ Property / cites work: On locally presented posets / rank @@
+Normal rank
@@ Property / cites work @@
+Q4003410
@@ Property / cites work: Q4003410 / rank @@
+Normal rank
@@ Property / cites work @@
+Universal partial order represented by means of oriented trees and other simple graphs
+Normal rank
@@ Property / cites work @@
+Q4004146
@@ Property / cites work: Q4004146 / rank @@
+Normal rank
@@ Property / cites work @@
+Path homomorphisms
@@ Property / cites work: Path homomorphisms / rank @@
+Normal rank
@@ Property / cites work @@
+Q3208855
@@ Property / cites work: Q3208855 / rank @@
+Normal rank
@@ Property / cites work @@
+Countable homogeneous partially ordered sets
@@ Property / cites work: Countable homogeneous partially ordered sets / rank @@
+Normal rank
@@ Property / DBLP publication ID @@
+journals/order/HubickaN05
@@ Property / DBLP publication ID: journals/order/HubickaN05 / rank @@
+Normal rank