scientific article; zbMATH DE number 863511
From MaRDI portal
Publication:4871790
chromatic numbercompactness principlegraph invariantsinfinitary combinatoricsinfinite graphsKönig lemmalarge cardinalspartition problemsRamsey type resultssurveytreesuncountably chromatic graphs
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Other combinatorial set theory (03E05) Large cardinals (03E55) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)
Recommendations
Cited in
(10)- An infinite version of the Pólya enumeration theorem
- Two remarks on the coloring number
- An uncountable version of Pták's combinatorial lemma
- On homogeneous sets of positive integers
- Elementary submodels in infinite combinatorics
- Infinite Combinatorics
- scientific article; zbMATH DE number 5294801 (Why is no real title available?)
- Infinite combinatorics plain and simple
- List-compactness of infinite directed graphs
- Disjointness graphs of short polygonal chains
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4871790)