Finite paths are universal

DOI10.1007/s11083-005-9005-xzbMath1092.06002DBLPjournals/order/HubickaN05OpenAlexW204085907WikidataQ81727351 ScholiaQ81727351MaRDI QIDQ5920532

Jan Hubička, Jaroslav Nešetřil

Publication date: 2 May 2006

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11083-005-9005-x

zbMATH Keywords

partially ordered setoriented path

Mathematics Subject Classification ID

Partial orders, general (06A06) Combinatorics of partially ordered sets (06A07) Paths and cycles (05C38)

Related Items (9)

Minimal universal and dense minor closed classes ⋮ No finite-infinite antichain duality in the homomorphism poset of directed graphs ⋮ Towards a characterization of universal categories ⋮ On Finite Maximal Antichains in the Homomorphism Order ⋮ Labeled posets are universal ⋮ Homomorphism order of connected monounary algebras ⋮ Finite dualities and map-critical graphs on a fixed surface ⋮ A surprising permanence of old motivations (a not-so-rigid story) ⋮ Cycle‐Continuous Mappings—Order Structure

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On locally presented posets
• Countable homogeneous partially ordered sets
• Endomorphism monoids and topological subgraphs of graphs
• Universal partial order represented by means of oriented trees and other simple graphs
• Automorphism groups of graphs and edge-contraction
• On universal partly ordered sets and classes
• The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments
• Duality and Polynomial Testing of Tree Homomorphisms
• Path homomorphisms
• Groups and Monoids of Regular Graphs (And of Graphs with Bounded Degrees)

This page was built for publication: Finite paths are universal