Solution to the problem of Kubesa

Mariusz Meszka. "Solution to the problem of Kubesa." Discussiones Mathematicae Graph Theory 28.2 (2008): 375-378. <http://eudml.org/doc/270723>.

@article{MariuszMeszka2008,
abstract = {An infinite family of T-factorizations of complete graphs $K_\{2n\}$, where 2n = 56k and k is a positive integer, in which the set of vertices of T can be split into two subsets of the same cardinality such that degree sums of vertices in both subsets are not equal, is presented. The existence of such T-factorizations provides a negative answer to the problem posed by Kubesa.},
author = {Mariusz Meszka},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {tree; T-factorization; degree sequence; -factorization},
language = {eng},
number = {2},
pages = {375-378},
title = {Solution to the problem of Kubesa},
url = {http://eudml.org/doc/270723},
volume = {28},
year = {2008},
}

TY - JOUR
AU - Mariusz Meszka
TI - Solution to the problem of Kubesa
JO - Discussiones Mathematicae Graph Theory
PY - 2008
VL - 28
IS - 2
SP - 375
EP - 378
AB - An infinite family of T-factorizations of complete graphs $K_{2n}$, where 2n = 56k and k is a positive integer, in which the set of vertices of T can be split into two subsets of the same cardinality such that degree sums of vertices in both subsets are not equal, is presented. The existence of such T-factorizations provides a negative answer to the problem posed by Kubesa.
LA - eng
KW - tree; T-factorization; degree sequence; -factorization
UR - http://eudml.org/doc/270723
ER -