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

Result code in 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>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

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

Original language description

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.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2010

Confidentiality

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

Name of the periodical

Discrete Mathematics

ISSN

0012-365X

e-ISSN

—

Volume of the periodical

310

Issue of the periodical within the volume

5

Country of publishing house

NL - THE KINGDOM OF THE NETHERLANDS

Number of pages

13

Pages from-to

—

UT code for WoS article

000274126000004

EID of the result in the Scopus database

—