Cycle-continuous mappings - order structure

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F13%3A10190655" target="_blank" >RIV/00216208:11320/13:10190655 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Cycle-continuous mappings - order structure

Original language description

Given two graphs, a mapping between their edge-sets is cycle-continuous, if the preimage of every cycle is a cycle. Answering a question of DeVos, Nešetřil, and Raspaud, we prove that there exists an infinite set of graphs with no cycle-continuous mapping between them. Further extending this result, we show that every countable poset can be represented by graphs and existence of cycle-continuous mappings between them.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2013

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

CRM Series

ISBN

978-88-7642-474-8

ISSN

—

e-ISSN

—

Number of pages

8

Pages from-to

513-520

Publisher name

Scuola Normale Superiore

Place of publication

Itálie

Event location

Itálie

Event date

Sep 9, 2013

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—