Finite paths are universal

DOI10.1007/s11083-004-3345-9zbMath1079.06002OpenAlexW1994957743MaRDI QIDQ5921694

Jaroslav Nešetřil, Jan Hubička

Publication date: 24 November 2005

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11083-004-3345-9

zbMATH Keywords

embeddingshomomorphismsuniversal graphsuniversal posets

Mathematics Subject Classification ID

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

Related Items (7)

An universality argument for graph homomorphisms ⋮ Fractal property of the graph homomorphism order ⋮ Finite duality for some minor closed classes ⋮ A finite presentation of the rational Urysohn space ⋮ Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms ⋮ Universal partial order represented by means of oriented trees and other simple graphs ⋮ Universality of intervals of line graph order

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On locally presented posets
• Countable homogeneous partially ordered sets
• Endomorphism monoids and topological subgraphs of graphs
• Duality theorems for finite structures (characterising gaps and good characterisations)
• Automorphism groups of graphs and edge-contraction
• On universal partly ordered sets and classes
• Homomorphisms of graphs into odd cycles
• Universal Infinite Partially Ordered Sets
• 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