Forcing constructions for uncountably chromatic graphs
From MaRDI portal
Recommendations
Cites work
- A Negative Partition Relation
- Can you take Solovay's inaccessible away?
- Chromatic number of finite and infinite graphs and hypergraphs
- scientific article; zbMATH DE number 3230204 (Why is no real title available?)
- The Ramsey property for graphs with forbidden complete subgraphs
- What must and what need not be contained in a graph of uncountable chromatic number?
Cited in
(22)- An uncountably chromatic triple system
- Some downwards transfer properties for \(\aleph _ 2\)
- Consistency results on infinite graphs
- Extremal triangle-free and odd-cycle-free colourings of uncountable graphs
- On the growth rate of chromatic numbers of finite subgraphs
- The chromatic number of infinite graphs - A survey
- Elementary submodels in infinite combinatorics
- A note on uncountable chordal graphs
- Same graph, different universe
- Forcing structures and cliques in uniquely vertex colorable graphs
- scientific article; zbMATH DE number 426350 (Why is no real title available?)
- Generic graph construction
- scientific article; zbMATH DE number 3987277 (Why is no real title available?)
- scientific article; zbMATH DE number 1083161 (Why is no real title available?)
- scientific article; zbMATH DE number 1795298 (Why is no real title available?)
- Trees, ladders and graphs
- NOTES ON SOME ERDŐS–HAJNAL PROBLEMS
- Some remarks on obligatory subsystems of uncountably chromatic triple systems
- Chromatic Ramsey theory
- Hajnal-Máté graphs, Cohen reals, and disjoint-type guessing
- The Erdős-Hajnal problem list
- On \({\mathfrak c}^+\)-chromatic graphs with small bounded subgraphs
This page was built for publication: Forcing constructions for uncountably chromatic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3804690)
