On the Homomorphism Order of Oriented Paths and Trees

Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F21%3A10437127" target="_blank" >RIV/00216208:11320/21:10437127 - isvavai.cz</a>
Výsledek na webu
<a href="https://doi.org/https://doi.org/10.1007/978-3-030-83823-2_118" target="_blank" >https://doi.org/https://doi.org/10.1007/978-3-030-83823-2_118</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-030-83823-2_118" target="_blank" >10.1007/978-3-030-83823-2_118</a>

Jazyk výsledku
angličtina
Název v původním jazyce
On the Homomorphism Order of Oriented Paths and Trees
Popis výsledku v původním jazyce
A partial order is universal if it contains every countable partial order as a suborder. In 2017, Fiala, Hubička, Long and Nešetřil showed that every interval in the homomorphism order of graphs is universal, with the only exception being the trivial gap [K1,K2]. We consider the homomorphism order restricted to the class of oriented paths and trees. We show that every interval between two oriented paths or oriented trees of height at least 4 is universal. The exceptional intervals coincide for oriented paths and trees and are contained in the class of oriented paths of height at most 3, which forms a chain.
Název v anglickém jazyce
On the Homomorphism Order of Oriented Paths and Trees
Popis výsledku anglicky
A partial order is universal if it contains every countable partial order as a suborder. In 2017, Fiala, Hubička, Long and Nešetřil showed that every interval in the homomorphism order of graphs is universal, with the only exception being the trivial gap [K1,K2]. We consider the homomorphism order restricted to the class of oriented paths and trees. We show that every interval between two oriented paths or oriented trees of height at least 4 is universal. The exceptional intervals coincide for oriented paths and trees and are contained in the class of oriented paths of height at most 3, which forms a chain.

Druh
D - Stať ve sborníku
CEP obor
—
OECD FORD obor
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt
<a href="/cs/project/GA21-10775S" target="_blank" >GA21-10775S: Ramseyova teorie v kontextu teorie grup, teorie modelů a topologické dynamiky</a><br>
Návaznosti
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění
2021
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Podobné výsledky(10)