Infinite stable graphs with large chromatic number
From MaRDI portal
(Redirected from Publication:5036100)
Recommendations
Cites work
- A Combinatorial Theorem
- A course in model theory
- A group version of stable regularity
- Atomic compactness and elementary equivalence
- Classification theory and the number of non-isomorphic models
- Cycles in graphs of uncountable chromatic number
- Finite subgraphs of uncountably chromatic graphs
- scientific article; zbMATH DE number 1002918 (Why is no real title available?)
- scientific article; zbMATH DE number 53151 (Why is no real title available?)
- scientific article; zbMATH DE number 3468845 (Why is no real title available?)
- scientific article; zbMATH DE number 3262991 (Why is no real title available?)
- scientific article; zbMATH DE number 3383912 (Why is no real title available?)
- On chromatic number of graphs and set-systems
- Regularity lemmas for stable graphs
- Saturated models and models that are generated by indiscernibles
- Stable graphs
- Stable theories and representation over sets
- STATIONARY TYPES IN MODULESS
- Superstable theories and representation
- The chromatic number of infinite graphs - A survey
- What must and what need not be contained in a graph of uncountable chromatic number?
Cited in
(3)
This page was built for publication: Infinite stable graphs with large chromatic number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5036100)