Homomorphisms of Cayley Graphs and Cycle Double Covers

Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F20%3A10423619" target="_blank" >RIV/00216208:11320/20:10423619 - isvavai.cz</a>
Výsledek na webu
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=X~5x71eFFY" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=X~5x71eFFY</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.37236/8456" target="_blank" >10.37236/8456</a>

Jazyk výsledku
angličtina
Název v původním jazyce
Homomorphisms of Cayley Graphs and Cycle Double Covers
Popis výsledku v původním jazyce
We study the following conjecture of Matt DeVos: If there is a graph homomorphism from a Cayley graph Cay(M, B) to another Cayley graph Cay(M', B') then every graph with an (M, B)-flow has an (M', B')-flow. This conjecture was originally motivated by the flow-tension duality. We show that a natural strengthening of this conjecture does not hold in all cases but we conjecture that it still holds for an interesting subclass of them and we prove a partial result in this direction. We also show that the original conjecture implies the existence of an oriented cycle double cover with a small number of cycles.
Název v anglickém jazyce
Homomorphisms of Cayley Graphs and Cycle Double Covers
Popis výsledku anglicky
We study the following conjecture of Matt DeVos: If there is a graph homomorphism from a Cayley graph Cay(M, B) to another Cayley graph Cay(M', B') then every graph with an (M, B)-flow has an (M', B')-flow. This conjecture was originally motivated by the flow-tension duality. We show that a natural strengthening of this conjecture does not hold in all cases but we conjecture that it still holds for an interesting subclass of them and we prove a partial result in this direction. We also show that the original conjecture implies the existence of an oriented cycle double cover with a small number of cycles.

Druh
J<sub>imp</sub> - Článek v periodiku v databázi Web of Science
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/GA19-21082S" target="_blank" >GA19-21082S: Grafy a jejich algebraické vlastnosti</a><br>
Návaznosti
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění
2020
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)