Authors:
U. Abraham Ben-Gurion University of the Negev Department of Mathematics Negev Israel

Search for other papers by U. Abraham in
Current site
Google Scholar
PubMed
Close
and
Y. Yin Carnegie-Mellon University Department of Mathematics Pittsburgh PA USA

Search for other papers by Y. Yin in
Current site
Google Scholar
PubMed
Close
Restricted access

Abstract  

We investigate the chromatic number of infinite graphs whose definition is motivated by the theorem of Engelking and Karłowicz (in [?]). In these graphs, the vertices are subsets of an ordinal, and two subsets X and Y are connected iff for some aXY the order-type of aX is different from that of aY. In addition to the chromatic number x(G) of these graphs we study χκ(G), the κ-chromatic number, which is the least cardinal µ with a decomposition of the vertices into µ classes none of which contains a κ-complete subgraph.

  • Collapse
  • Expand

To see the editorial board, please visit the website of Springer Nature.

Manuscript Submission: HERE

For subscription options, please visit the website of Springer Nature.

Acta Mathematica Hungarica
Language English
Size B5
Year of
Foundation
1950
Volumes
per Year
3
Issues
per Year
6
Founder Magyar Tudományos Akadémia  
Founder's
Address
H-1051 Budapest, Hungary, Széchenyi István tér 9.
Publisher Akadémiai Kiadó
Springer Nature Switzerland AG
Publisher's
Address
H-1117 Budapest, Hungary 1516 Budapest, PO Box 245.
CH-6330 Cham, Switzerland Gewerbestrasse 11.
Responsible
Publisher
Chief Executive Officer, Akadémiai Kiadó
ISSN 0236-5294 (Print)
ISSN 1588-2632 (Online)

Monthly Content Usage

Abstract Views Full Text Views PDF Downloads
Dec 2023 3 0 1
Jan 2024 2 0 1
Feb 2024 0 0 0
Mar 2024 0 0 0
Apr 2024 1 1 1
May 2024 2 0 0
Jun 2024 0 0 0