On Taylor's problem
Abstract
We describe some (countably many) classes Kn,e of finite graphs and prove that if lambdaaleph0= lambda then every lambda+-chromatic graph of cardinal lambda+ contains, for some n, e, all members of Kn,e as subgraphs. On the other hand, it is consistent for every regular infinite cardinal kappa that there is a kappa+-chromatic graph on kappa+ that contains finite subgraphs only from Kn,e .
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.