scientific article; zbMATH DE number 3262991
[For the entire collection see Zbl 0155.00201.] Aus einem Hauptresultat der Arbeit folgt mit Hilfe der allgemeinen Kontinuumhypothese: Zu je 2 Ordinalzahlen \(\xi,k\) (\(k \geq 1\) endlich) existiert ein Graph \(G\) mit \(\alpha(G) = \aleph_{\xi+k}\) Ecken und mit der chromatischen Zahl \(\text{Chr(G)} = \aleph_{\xi+1}\), so daß \(\text{Chr}(G') < \text{Chr}(G)\) für jeden Teilgraph \(G'\subseteq G\) mit \(\alpha(G') < \alpha(G)\). Zu vorgegebenen Kardinalzahlen \(\alpha,\gamma\) (\(\alpha\) regulär) werden Graphen \(G_{\alpha ,\gamma}\) konstruiert, die im folgenden Sinne universal sind: (1) \(\alpha(G_\alpha,\gamma) = \alpha;\) (2) \(G'\subseteq G_{\alpha,\gamma}\), \(\alpha(G') = \alpha \Rightarrow \text{Chr}(G')\leq \gamma\); (3) Jeder Graph \(G\), der (1) und (2) (mit \(G\) statt \(G_{\alpha,\gamma}\)) erfüllt, ist einem Teilgraph von \(G_{\alpha,\gamma}\) isomorph. Die Verff. zeigen weiter in Verschärfung eines Satzes von E. Milner, daß zu je 2 Ordinalzahlen \(\alpha,k\) (\(k \geq 1\) endlich) ein Mengensystem \((h,H)\) existiert mit: (a) \(h=\{\xi: 0\leq \xi < \omega_{\alpha+1}\}\) (b) \(X \in H\Rightarrow X\subseteq h\) und \(|X| = k\), (c) \(h'\subseteq h\), \(|h'| = \aleph_{\alpha+1} \Rightarrow\) es existiert ein \(X \in H\) mit \(X \subseteq h'\); (d) \(X,Y \in H\), \(\text{Max }X=\text{Max }Y \Rightarrow X=Y\) oder \(|X \cap Y| = 1;\) (e) \(X,Y \in H\), \(|X \cap Y| \geq 2\), \(a \in X \cap Y \Rightarrow a\) hat in \(X\) und \(Y\) bzgl. \(<\) die gleiche Höhe. Die Verff. formulieren explizit 8 Probleme; dabei wird (s. Problem 4) auf einen Zusammenhang mit einem Problem von Kurepa hingewiesen.
- Chromatic number of finite and infinite graphs and hypergraphs
- Coloring of universal graphs
- Coloring graphs with locally few colors
- Note on decomposition of spheres in Hilbert spaces
- Small spaces with large point character
- Connectivity and chromatic number of infinite graphs
- On coverings of infinite-dimensional metric spaces
- Borel chromatic numbers
- Shift graphs and lower bounds on Ramsey numbers \(r_ k(l;r)\)
- Graph-theoretical methods in general function theory
- Some remarks on the simultaneous chromatic number
- On Taylor's problem
- Continuum many universal Horn classes of graphs of bounded chromatic number
- Extension of Gyárfás-Sumner conjecture to digraphs
- Notes on tree- and path-chromatic number
- Extractors for small zero-fixing sources
- Independent sets in subgraphs of a shift graph
- Regular partitions of gentle graphs
- The colouring number of infinite graphs
- Separating tree-chromatic number from path-chromatic number
- Same graph, different universe
- Locally restricted colorings
- Chromatic numbers of graphs -- large gaps
- Partition Relations Connected with the Chromatic Number of Graphs
- The chromatic number of finite type-graphs
- The list-chromatic number of infinite graphs
- A GCH Example of an Ordinal Graph with no Infinite Path
- Flipping triangles and rectangles
- scientific article; zbMATH DE number 3788655 (Why is no real title available?)
- Shift graphs on precompact families of finite sets of natural numbers
- SPECTRA AND CHROMATIC NUMBERS OF INFINITE GRAPHS
- Colorings of infinite graphs without one-colored rays
- Infinite stable graphs with large chromatic number
- On chromatic number of graphs and set-systems
- scientific article; zbMATH DE number 3308988 (Why is no real title available?)
- scientific article; zbMATH DE number 3316912 (Why is no real title available?)
- scientific article; zbMATH DE number 3068973 (Why is no real title available?)
- Burling graphs, chromatic number, and orthogonal tree-decompositions
- The list-chromatic number of infinite graphs defined on Euclidean spaces
- Infinite stable graphs with large chromatic number. II
- Variants of the Gyárfás-Sumner conjecture: oriented trees and rainbow paths
- Colorings of k-sets with low discrepancy on small sets
- Infinite cliques in simple and stable graphs
- The Erdős-Hajnal problem list
- Shift graphs, chromatic number and acyclic one-path orientations
- The gluing property
- Infinite generalized friendship graphs
- Interpretations of module varieties
- Infinite friendship graphs with infinite parameters
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)