Hedetniemi's conjecture for uncountable graphs

Assaf Rinot

doi:10.4171/JEMS/666

Hedetniemi's conjecture for uncountable graphs

Assaf Rinot

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

3 Scopus citations

Abstract

It is proved that in Godel's constructible universe, for every infinite successor cardinal, there exist graphs G and H of size and chromatic number, for which the product graph G × H is countably chromatic.

Original language	English
Pages (from-to)	285-298
Number of pages	14
Journal	Journal of the European Mathematical Society
Volume	19
Issue number	1
DOIs	https://doi.org/10.4171/JEMS/666
State	Published - 1 Jan 2017
Externally published	Yes

Keywords

Almost countably chromatic
Constructible universe
Hedetniemi's conjecture
Incompactness
Ostaszewski square
Product graph

ASJC Scopus subject areas

General Mathematics
Applied Mathematics

Access to Document

10.4171/JEMS/666

Cite this

@article{519289c1c6084098987ccf91fb734a2e,

title = "Hedetniemi's conjecture for uncountable graphs",

abstract = "It is proved that in Godel's constructible universe, for every infinite successor cardinal, there exist graphs G and H of size and chromatic number, for which the product graph G × H is countably chromatic.",

keywords = "Almost countably chromatic, Constructible universe, Hedetniemi's conjecture, Incompactness, Ostaszewski square, Product graph",

author = "Assaf Rinot",

note = "Publisher Copyright: {\textcopyright} 2017 European Mathematical Society.",

year = "2017",

month = jan,

day = "1",

doi = "10.4171/JEMS/666",

language = "English",

volume = "19",

pages = "285--298",

journal = "Journal of the European Mathematical Society",

issn = "1435-9855",

publisher = "European Mathematical Society Publishing House",

number = "1",

}

TY - JOUR

T1 - Hedetniemi's conjecture for uncountable graphs

AU - Rinot, Assaf

PY - 2017/1/1

Y1 - 2017/1/1

N2 - It is proved that in Godel's constructible universe, for every infinite successor cardinal, there exist graphs G and H of size and chromatic number, for which the product graph G × H is countably chromatic.

AB - It is proved that in Godel's constructible universe, for every infinite successor cardinal, there exist graphs G and H of size and chromatic number, for which the product graph G × H is countably chromatic.

KW - Almost countably chromatic

KW - Constructible universe

KW - Hedetniemi's conjecture

KW - Incompactness

KW - Ostaszewski square

KW - Product graph

UR - http://www.scopus.com/inward/record.url?scp=85007294837&partnerID=8YFLogxK

U2 - 10.4171/JEMS/666

DO - 10.4171/JEMS/666

M3 - Article

AN - SCOPUS:85007294837

SN - 1435-9855

VL - 19

SP - 285

EP - 298

JO - Journal of the European Mathematical Society

JF - Journal of the European Mathematical Society

IS - 1

ER -

Hedetniemi's conjecture for uncountable graphs

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this