Geodesic
A note on uncountably chromatic graphs
Nathan Bowler1 ; Max Pitz2
1Universität Hamburg
2University of Hamburg
The electronic journal of combinatorics, Tome 32 (2025) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We present an elementary construction of an uncountably chromatic graph without uncountable, infinitely connected subgraphs.
DOI : 10.37236/13359
Classification : 05C63, 05C30
Mots-clés : uncountably chromatic, connected subgraph, ladder system, non-special tree

Nathan Bowler  1   ; Max Pitz  2

1 Universität Hamburg
2 University of Hamburg 
@article{10_37236_13359,
     author = {Nathan Bowler and Max Pitz},
     title = {A note on uncountably chromatic graphs},
     journal = {The electronic journal of combinatorics},
     year = {2025},
     volume = {32},
     number = {1},
     doi = {10.37236/13359},
     zbl = {1559.05130},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/13359/}
}
TY  - JOUR
AU  - Nathan Bowler
AU  - Max Pitz
TI  - A note on uncountably chromatic graphs
JO  - The electronic journal of combinatorics
PY  - 2025
VL  - 32
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/13359/
DO  - 10.37236/13359
ID  - 10_37236_13359
ER  - 
%0 Journal Article
%A Nathan Bowler
%A Max Pitz
%T A note on uncountably chromatic graphs
%J The electronic journal of combinatorics
%D 2025
%V 32
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/13359/
%R 10.37236/13359
%F 10_37236_13359
Nathan Bowler; Max Pitz. A note on uncountably chromatic graphs. The electronic journal of combinatorics, Tome 32 (2025) no. 1. doi: 10.37236/13359

Cité par Sources :