Finite paths are universal (Q5920532): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Automorphism groups of graphs and edge-contraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Endomorphism monoids and topological subgraphs of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: On universal partly ordered sets and classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality and Polynomial Testing of Tree Homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Groups and Monoids of Regular Graphs (And of Graphs with Bounded Degrees) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On locally presented posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003410 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal partial order represented by means of oriented trees and other simple graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3208855 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Countable homogeneous partially ordered sets / rank
 
Normal rank

Revision as of 12:43, 24 June 2024

scientific article; zbMATH DE number 5021471
Language Label Description Also known as
English
Finite paths are universal
scientific article; zbMATH DE number 5021471

    Statements

    Finite paths are universal (English)
    0 references
    0 references
    0 references
    0 references
    2 May 2006
    0 references
    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
    partially ordered set
    0 references
    oriented path
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references