What must and what need not be contained in a graph of uncountable chromatic number?
From MaRDI portal
Publication:794660
DOI10.1007/BF02579156zbMATH Open0541.05026OpenAlexW2087986857MaRDI QIDQ794660FDOQ794660
Authors: Andras Hajnal, Péter Komjáth
Publication date: 1984
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02579156
Recommendations
- Short odd cycles in 4-chromatic graphs
- Small odd cycles in 4-chromatic graphs
- scientific article; zbMATH DE number 1067836
- Graphs with \(k\) odd cycle lengths
- Cycle lengths and chromatic number of graphs
- Cycle length parities and the chromatic number
- A strengthening on odd cycles in graphs of given chromatic number
- Cycle lengths in graphs with large minimum degree
- Edge condition for long cycles in bipartite graphs
- A bound on the chromatic number using the longest odd cycle length
Cites Work
Cited In (17)
- Title not available (Why is that?)
- The chromatic number of infinite graphs - A survey
- Hajnal-Máté graphs, Cohen reals, and disjoint-type guessing
- Semialgebraic graphs having countable list-chromatic numbers
- Forcing constructions for uncountably chromatic graphs
- Chromatic numbers of graphs -- large gaps
- Infinite stable graphs with large chromatic number. II
- Finite subgraphs of uncountably chromatic graphs
- Infinite stable graphs with large chromatic number
- SOME OF MY FAVORITE SOLVED AND UNSOLVED PROBLEMS IN GRAPH THEORY
- An uncountably chromatic triple system
- Trees, ladders and graphs
- On the growth rate of chromatic numbers of finite subgraphs
- Chromatic number of finite and infinite graphs and hypergraphs
- A note on uncountable chordal graphs
- Infinitely connected subgraphs in graphs of uncountable chromatic number
- On Taylor's problem
This page was built for publication: What must and what need not be contained in a graph of uncountable chromatic number?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q794660)