A short proof of a conjecture on the Tr-choice number of even cycles

R. A. Sitters

doi:10.1016/S0166-218X(99)00058-X

A short proof of a conjecture on the Tr-choice number of even cycles

R. A. Sitters^*

^*Corresponding author for this work

Amsterdam Business Research Institute

Research output: Contribution to Journal › Article › Academic › peer-review

Abstract

In this note we prove that the T_r-choice number of the cycle C_2n is equal to the T_r-choice number of the path (tree) on 4n - 1 vertices, i.e. T_r-ch(C_2n) = [((4n - 2)/(4n - 1))(2r + 2)] + 1. This solves a recent conjecture of Alon and Zaks.

Original language	English
Pages (from-to)	243-246
Number of pages	4
Journal	Discrete Applied Mathematics
Volume	92
Issue number	2-3
DOIs	https://doi.org/10.1016/S0166-218X(99)00058-X
Publication status	Published - Jun 1999

Access to Document

10.1016/S0166-218X(99)00058-X

Persistent URL (handle)

Persistent link

Cite this

@article{3a5875ebf8a742c8903b7f73a7a06627,

title = "A short proof of a conjecture on the Tr-choice number of even cycles",

abstract = "In this note we prove that the Tr-choice number of the cycle C2n is equal to the Tr-choice number of the path (tree) on 4n - 1 vertices, i.e. Tr-ch(C2n) = [((4n - 2)/(4n - 1))(2r + 2)] + 1. This solves a recent conjecture of Alon and Zaks.",

author = "Sitters, \{R. A.\}",

year = "1999",

month = jun,

doi = "10.1016/S0166-218X(99)00058-X",

language = "English",

volume = "92",

pages = "243--246",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier B.V.",

number = "2-3",

}

TY - JOUR

T1 - A short proof of a conjecture on the Tr-choice number of even cycles

AU - Sitters, R. A.

PY - 1999/6

Y1 - 1999/6

N2 - In this note we prove that the Tr-choice number of the cycle C2n is equal to the Tr-choice number of the path (tree) on 4n - 1 vertices, i.e. Tr-ch(C2n) = [((4n - 2)/(4n - 1))(2r + 2)] + 1. This solves a recent conjecture of Alon and Zaks.

AB - In this note we prove that the Tr-choice number of the cycle C2n is equal to the Tr-choice number of the path (tree) on 4n - 1 vertices, i.e. Tr-ch(C2n) = [((4n - 2)/(4n - 1))(2r + 2)] + 1. This solves a recent conjecture of Alon and Zaks.

UR - https://www.scopus.com/pages/publications/0042097757

UR - https://www.scopus.com/pages/publications/0042097757#tab=citedBy

U2 - 10.1016/S0166-218X(99)00058-X

DO - 10.1016/S0166-218X(99)00058-X

M3 - Article

AN - SCOPUS:0042097757

SN - 0166-218X

VL - 92

SP - 243

EP - 246

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

IS - 2-3

ER -

A short proof of a conjecture on the Tr-choice number of even cycles

Abstract

Access to Document

Persistent URL (handle)

Other files and links

Fingerprint

Cite this