Solution to the problem of Kubesa

• Autorzy: Mariusz Meszka
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

tree   T-factorization   degree sequence  

Kategorie tematyczne

• 05C05: Trees
• 05C07: Vertex degrees
• 05C70: Factorization, matching, partitioning, covering and packing

• Wydawca: De Gruyter Open
• Czasopismo: Discussiones Mathematicae Graph Theory
• Rocznik: 2008
• Tom: 28
• Numer: 2
• Strony: 375-378

Daty

wydano

2008

otrzymano

2008-01-09

poprawiono

2008-02-11

zaakceptowano

2008-02-11

Twórcy

autor

Mariusz Meszka

• Faculty of Applied Mathematics, AGH University of Science and Technology, Mickiewicza 30, 30-059, Kraków, Poland

Bibliografia

• [1] D. Froncek and T. Kovarova, Personal communication, 2004-6.
• [2] D. Froncek and M. Kubesa, Problem presented at the Workshop in Krynica 2004, Discuss. Math. Graph Theory 26 (2006) 351.
• [3] N.D. Tan, On a problem of Froncek and Kubesa, Australas. J. Combin. 40 (2008) 237-246.

Identyfikatory

DOI

10.7151/dmgt.1413