scientific article; zbMATH DE number 426350

zbMATH Open0793.03054MaRDI QIDQ3137199FDOQ3137199

Authors: Péter Komjáth 

Publication date: 21 August 1994

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

consistencychromatic numberCHGCH

Mathematics Subject Classification ID

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

Cited In (17)

• Monocolored topological complete graphs in colorings of uncountable complete graphs
• A graph which embeds all small graphs on any large set of vertices
• Generic graph construction
• Erdős Graphs Resolve Fine's Canonicity Problem
• Same graph, different universe
• Forcing constructions for uncountably chromatic graphs
• Chromatic numbers of graphs -- large gaps
• Extremal triangle-free and odd-cycle-free colourings of uncountable graphs
• Title not available (Why is that?)
• Uncountable dichromatic number without short directed cycles
• Finite subgraphs of uncountably chromatic graphs
• Title not available (Why is that?)
• On the growth rate of chromatic numbers of finite subgraphs
• Hedetniemi's conjecture for uncountable graphs
• Orientations of graphs with uncountable chromatic number
• A note on minor antichains of uncountable graphs
• Some remarks on the simultaneous chromatic number

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)