A short proof of a conjecture on the T(r)-choice number of even cycles

R.A. Sitters

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

A short proof of a conjecture on the T(r)-choice number of even cycles

R.A. Sitters

Combinatorial Optimization - BETA

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

3 Citations (Scopus)

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.

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

Access to Document

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

Fingerprint Dive into the research topics of 'A short proof of a conjecture on the T(r)-choice number of even cycles'. Together they form a unique fingerprint.

Cite this

@article{7aedcd172d3f4fabb157351f9c2cdad1,

title = "A short proof of a conjecture on the T(r)-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 = "R.A. Sitters",

year = "1999",

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

language = "English",

volume = "92",

pages = "243--246",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier",

number = "2-3",

}

TY - JOUR

T1 - A short proof of a conjecture on the T(r)-choice number of even cycles

AU - Sitters, R.A.

PY - 1999

Y1 - 1999

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.

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

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

M3 - Article

VL - 92

SP - 243

EP - 246

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

IS - 2-3

ER -