THE COLORING OF THE TREE OF COLORINGS

Y Cherniavsky; A Jarden

doi:10.17654/0974165822050

THE COLORING OF THE TREE OF COLORINGS

Y Cherniavsky, A Jarden

Department of Mathematics

Ariel University

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

Abstract

In the present paper, we continue the investigation of a relation between trees and colorings that was introduced in [1]. In [1], two mappings were defined: a function C bar right arrow T(C) assigns to each coloring a tree, and a function (T, e) bar right arrow C(T, e) assigns to each tree with an enumeration a coloring. Here we show that the coloring C is not reconstructable from T(C), although the tree T is reconstructable from C(T, e), under certain restrictions on T and e.

Original language	English
Pages (from-to)	37-44
Number of pages	8
Journal	Advances and Applications in Discrete Mathematics
Volume	35
DOIs	https://doi.org/10.17654/0974165822050
State	Published - 2022

Keywords

additive colorings
tree in set theory

Access to Document

10.17654/0974165822050

Cite this

@article{6922f964c001486d9d317a36bfb57935,

title = "THE COLORING OF THE TREE OF COLORINGS",

abstract = "In the present paper, we continue the investigation of a relation between trees and colorings that was introduced in [1]. In [1], two mappings were defined: a function C bar right arrow T(C) assigns to each coloring a tree, and a function (T, e) bar right arrow C(T, e) assigns to each tree with an enumeration a coloring. Here we show that the coloring C is not reconstructable from T(C), although the tree T is reconstructable from C(T, e), under certain restrictions on T and e.",

keywords = "additive colorings, tree in set theory",

author = "Y Cherniavsky and A Jarden",

note = "Times Cited in Web of Science Core Collection: 0 Total Times Cited: 0 Cited Reference Count: 3",

year = "2022",

doi = "10.17654/0974165822050",

language = "الإنجليزيّة",

volume = "35",

pages = "37--44",

journal = "Advances and Applications in Discrete Mathematics",

issn = "0974-1658",

}

TY - JOUR

T1 - THE COLORING OF THE TREE OF COLORINGS

AU - Cherniavsky, Y

AU - Jarden, A

N1 - Times Cited in Web of Science Core Collection: 0 Total Times Cited: 0 Cited Reference Count: 3

PY - 2022

Y1 - 2022

N2 - In the present paper, we continue the investigation of a relation between trees and colorings that was introduced in [1]. In [1], two mappings were defined: a function C bar right arrow T(C) assigns to each coloring a tree, and a function (T, e) bar right arrow C(T, e) assigns to each tree with an enumeration a coloring. Here we show that the coloring C is not reconstructable from T(C), although the tree T is reconstructable from C(T, e), under certain restrictions on T and e.

AB - In the present paper, we continue the investigation of a relation between trees and colorings that was introduced in [1]. In [1], two mappings were defined: a function C bar right arrow T(C) assigns to each coloring a tree, and a function (T, e) bar right arrow C(T, e) assigns to each tree with an enumeration a coloring. Here we show that the coloring C is not reconstructable from T(C), although the tree T is reconstructable from C(T, e), under certain restrictions on T and e.

KW - additive colorings

KW - tree in set theory

U2 - 10.17654/0974165822050

DO - 10.17654/0974165822050

M3 - مقالة

SN - 0974-1658

VL - 35

SP - 37

EP - 44

JO - Advances and Applications in Discrete Mathematics

JF - Advances and Applications in Discrete Mathematics

ER -