The following pages link to The Colouring Number (Q3701415):
Displaying 20 items.
- Chromatic numbers of graphs -- large gaps (Q313434) (← links)
- The list-chromatic number of infinite graphs (Q375873) (← links)
- Monocolored topological complete graphs in colorings of uncountable complete graphs (Q822604) (← links)
- A graph which embeds all small graphs on any large set of vertices (Q1101446) (← links)
- Two remarks on the coloring number (Q1362106) (← links)
- On the connectivity of infinite graphs (Q1705205) (← links)
- Bipartite graphs and monochromatic squares (Q1732805) (← links)
- On Taylor's problem (Q1912691) (← links)
- Ramsey theory for highly connected monochromatic subgraphs (Q2036568) (← links)
- Multicolor Turán numbers (Q2144522) (← links)
- The chromatic number of infinite graphs - A survey (Q2275377) (← links)
- The colouring number of infinite graphs (Q2300155) (← links)
- A note on the Engelking-Karłowicz theorem (Q2390149) (← links)
- (Q2934665) (← links)
- Embedding Graphs into Colored Graphs (Q3808084) (← links)
- Colorful Partitions of Cardinal Numbers (Q3852184) (← links)
- An order- and graph-theoretical characterisation of weakly compact cardinals (Q3972096) (← links)
- INFINITE COMBINATORICS PLAIN AND SIMPLE (Q4692090) (← links)
- Putting a diamond inside the square (Q5255535) (← links)
- A note on edge colorings and trees (Q6094165) (← links)