Shelah’s revised GCH theorem and a question by Alon on infinite graphs colorings

Menachem Kojman

doi:https://doi.org/10.1007/s11856-014-0035-1

Shelah’s revised GCH theorem and a question by Alon on infinite graphs colorings

Menachem Kojman

Department of Mathematics

Ben-Gurion University of the Negev

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

Abstract

For every graph G, the coloring number of G does not exceed the least strong limit cardinal above the graph’s list-chromatic number.

Original language	American English
Pages (from-to)	585-592
Number of pages	8
Journal	Israel Journal of Mathematics
Volume	201
Issue number	2
DOIs	https://doi.org/10.1007/s11856-014-0035-1
State	Published - 2 Oct 2014

All Science Journal Classification (ASJC) codes

General Mathematics

Access to Document

https://doi.org/10.1007/s11856-014-0035-1

Cite this

@article{71f7375831294106ab8e57345bcc9205,

title = "Shelah{\textquoteright}s revised GCH theorem and a question by Alon on infinite graphs colorings",

abstract = "For every graph G, the coloring number of G does not exceed the least strong limit cardinal above the graph{\textquoteright}s list-chromatic number.",

author = "Menachem Kojman",

note = "Publisher Copyright: {\textcopyright} 2014, Hebrew University Magnes Press.",

year = "2014",

month = oct,

day = "2",

doi = "https://doi.org/10.1007/s11856-014-0035-1",

language = "American English",

volume = "201",

pages = "585--592",

journal = "Israel Journal of Mathematics",

issn = "0021-2172",

publisher = "Springer New York",

number = "2",

}

TY - JOUR

T1 - Shelah’s revised GCH theorem and a question by Alon on infinite graphs colorings

AU - Kojman, Menachem

PY - 2014/10/2

Y1 - 2014/10/2

N2 - For every graph G, the coloring number of G does not exceed the least strong limit cardinal above the graph’s list-chromatic number.

AB - For every graph G, the coloring number of G does not exceed the least strong limit cardinal above the graph’s list-chromatic number.

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

U2 - https://doi.org/10.1007/s11856-014-0035-1

DO - https://doi.org/10.1007/s11856-014-0035-1

M3 - Article

SN - 0021-2172

VL - 201

SP - 585

EP - 592

JO - Israel Journal of Mathematics

JF - Israel Journal of Mathematics

IS - 2

ER -

Shelah’s revised GCH theorem and a question by Alon on infinite graphs colorings

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this