Decompositions of complete graphs into blown-up cycles C-m[2]

Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F10%3A10224378" target="_blank" >RIV/61989100:27240/10:10224378 - isvavai.cz</a>
Výsledek na webu
—
DOI - Digital Object Identifier
—

Jazyk výsledku
angličtina
Název v původním jazyce
Decompositions of complete graphs into blown-up cycles C-m[2]
Popis výsledku v původním jazyce
Let C-m vertical bar(K) over bar (2)vertical bar stand for a cycle C-m in which every vertex is replaced by two isolated vertices and every edge by K-2,K-2. We prove that the complete graph K8mk+1 can be decomposed into graphs isomorphic to C-m verticalbar(K) over bar (2)vertical bar for any m }= 3, k } 0. Decompositions of complete graphs into certain collections of even cycles are obtained as a corollary. Also some special cases of Alspach Conjecture are solved in this article. All proofs are constructive and use both graph theory and design theory techniques.
Název v anglickém jazyce
Decompositions of complete graphs into blown-up cycles C-m[2]
Popis výsledku anglicky
Let C-m vertical bar(K) over bar (2)vertical bar stand for a cycle C-m in which every vertex is replaced by two isolated vertices and every edge by K-2,K-2. We prove that the complete graph K8mk+1 can be decomposed into graphs isomorphic to C-m verticalbar(K) over bar (2)vertical bar for any m }= 3, k } 0. Decompositions of complete graphs into certain collections of even cycles are obtained as a corollary. Also some special cases of Alspach Conjecture are solved in this article. All proofs are constructive and use both graph theory and design theory techniques.

Druh
J<sub>x</sub> - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
CEP obor
BA - Obecná matematika
OECD FORD obor
—

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