scientific article; zbMATH DE number 3262991
From MaRDI portal
Publication:5548831
zbMATH Open0164.24803MaRDI QIDQ5548831FDOQ5548831
Authors: Andras Hajnal, P. Erdős 
Publication date: 1968
Title of this publication is not available (Why is that?)
Recommendations
Cited In (42)
- A GCH Example of an Ordinal Graph with no Infinite Path
- Connectivity and chromatic number of infinite graphs
- Title not available (Why is that?)
- Regular partitions of gentle graphs
- Locally restricted colorings
- Interpretations of module varieties
- Separating tree-chromatic number from path-chromatic number
- Title not available (Why is that?)
- Independent sets in subgraphs of a shift graph
- Extension of Gyárfás-Sumner conjecture to digraphs
- Borel chromatic numbers
- Same graph, different universe
- Coloring graphs with locally few colors
- Shift graphs on precompact families of finite sets of natural numbers
- Title not available (Why is that?)
- Chromatic numbers of graphs -- large gaps
- Small spaces with large point character
- On coverings of infinite-dimensional metric spaces
- On chromatic number of graphs and set-systems
- Partition Relations Connected with the Chromatic Number of Graphs
- SPECTRA AND CHROMATIC NUMBERS OF INFINITE GRAPHS
- Infinite stable graphs with large chromatic number. II
- Continuum many universal Horn classes of graphs of bounded chromatic number
- Burling graphs, chromatic number, and orthogonal tree-decompositions
- Title not available (Why is that?)
- Infinite stable graphs with large chromatic number
- Coloring of universal graphs
- Extractors for small zero-fixing sources
- Variants of the Gyárfás-Sumner conjecture: oriented trees and rainbow paths
- Colorings of infinite graphs without one-colored rays
- The chromatic number of finite type-graphs
- Graph-theoretical methods in general function theory
- Infinite friendship graphs with infinite parameters
- Note on decomposition of spheres in Hilbert spaces
- Notes on tree- and path-chromatic number
- Infinite generalized friendship graphs
- Chromatic number of finite and infinite graphs and hypergraphs
- Shift graphs and lower bounds on Ramsey numbers \(r_ k(l;r)\)
- The colouring number of infinite graphs
- Some remarks on the simultaneous chromatic number
- The list-chromatic number of infinite graphs defined on Euclidean spaces
- Flipping triangles and rectangles
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 Q5548831)
