scientific article; zbMATH DE number 426350

MaRDI QIDQ3137199zbMATH OpenFDO

Authors Péter Komjáth

Publication date 21 August 1994

zbMATH Keywords

CHchromatic numberconsistencyGCH

Mathematics Subject Classification ID

Model theory of denumerable and separable structures (03C15) Consistency and independence results (03E35) Continuum hypothesis and Martin's axiom (03E50)

Recommendations

• Forcing constructions for uncountably chromatic graphs
• Consistency results on infinite graphs
• On the growth rate of chromatic numbers of finite subgraphs
• Chromatic numbers of graphs -- large gaps
• Generic graph construction

Cited in

(21)

• A graph which embeds all small graphs on any large set of vertices
• An \(\aleph_1\)-dense ideal on \(\aleph_2\)
• Some remarks on the simultaneous chromatic number
• Extremal triangle-free and odd-cycle-free colourings of uncountable graphs
• On the growth rate of chromatic numbers of finite subgraphs
• Same graph, different universe
• scientific article; zbMATH DE number 6612443 (Why is no real title available?)
• Chromatic numbers of graphs -- large gaps
• scientific article; zbMATH DE number 4208094 (Why is no real title available?)
• Generic graph construction
• The list-chromatic number of infinite graphs
• scientific article; zbMATH DE number 4047709 (Why is no real title available?)
• Forcing constructions for uncountably chromatic graphs
• scientific article; zbMATH DE number 1083161 (Why is no real title available?)
• Orientations of graphs with uncountable chromatic number
• Erdős Graphs Resolve Fine's Canonicity Problem
• Finite subgraphs of uncountably chromatic graphs
• Hedetniemi's conjecture for uncountable graphs
• Uncountable dichromatic number without short directed cycles
• A note on minor antichains of uncountable graphs
• Monocolored topological complete graphs in colorings of uncountable complete graphs

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 Q3137199)