scientific article; zbMATH DE number 3068973
From MaRDI portal
Publication:5808059
zbMath0044.38203MaRDI QIDQ5808059
No author found.
Publication date: 1951
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
The role of the Axiom of Choice in proper and distinguishing colourings ⋮ Some results in graph theory and their application to abstract relational biology ⋮ A recursive Lovász theta number for simplex-avoiding sets ⋮ Coloring distance graphs on the plane ⋮ Chromatic number of a line with geometric progressions of forbidden distances and the complexity of recognizing distance graphs ⋮ Interview with Andrei Raigorodskii ⋮ Hall's theorem for enumerable families of finite sets ⋮ Chromatic numbers of Cayley graphs of abelian groups: a matrix method ⋮ Rosenthal families, pavings, and generic cardinal invariants ⋮ Measurable sets with excluded distances ⋮ Unnamed Item ⋮ Systems of representatives ⋮ On Fixed-Point Free Selections and Multivalued Maps on R ⋮ Unnamed Item ⋮ Some of My Favorite Coloring Problems for Graphs and Digraphs ⋮ On Baire measurable colorings of group actions ⋮ The quest for a characterization of hom-properties of finite character ⋮ Lower bounds for the chromatic numbers of distance graphs with large girth ⋮ On large subgraphs with small chromatic numbers contained in distance graphs ⋮ On the chromatic numbers of integer and rational lattices ⋮ Extremal problems concerning transformations of the set of edges of the complete graph ⋮ A proof of Dilworth's decomposition theorem for partially ordered sets ⋮ On computational complexity of length embeddability of graphs ⋮ The use of elementary substructures in combinatorics ⋮ Distance Ramsey numbers ⋮ Chromatic numbers of graphs -- large gaps ⋮ On embedding of finite distance graphs with large chromatic number in random graphs ⋮ Some generalizations of theorems on vertex coloring ⋮ Two remarks on the coloring number ⋮ Coloring of commutative rings ⋮ Finite sets as complements of finite unions of convex sets ⋮ Unit-distance graphs, graphs on the integer lattice and a Ramsey type result ⋮ A condition for assured 3-face-colorability of infinite plane graphs with a given spanning tree ⋮ On the structure of the power graph and the enhanced power graph of a group ⋮ Simplicial decompositions of graphs: A survey of applications ⋮ Axiom of choice and chromatic number: Examples on the plane ⋮ Universal \(H\)-colourable graphs ⋮ On the connectivity of unit distance graphs ⋮ Dangerous reference graphs and semantic paradoxes ⋮ On the growth rate of chromatic numbers of finite subgraphs ⋮ New bounds for the distance Ramsey number ⋮ Constructing 5-chromatic unit distance graphs embedded in the Euclidean plane and two-dimensional spheres ⋮ A generalisation of a theorem of de Bruijn and Erdős on the chromatic numbers of infinite graphs ⋮ Chromatic numbers of subgraphs ⋮ Chromatic numbers of distance graphs with several forbidden distances and without cliques of a given size ⋮ Chromatic number and clique number of subgraphs of regular graph of matrix algebras ⋮ On universal positive graphs ⋮ On total and regular graphs of a polynomial ⋮ Axiom of choice and chromatic number of the plane ⋮ Computational aspects of relaxation complexity: possibilities and limitations ⋮ On distance subgraphs of graphs in spaces of lower dimensions ⋮ The realization of distances in measurable subsets covering \(R^ n\). ⋮ On the chromatic number for a set of metric spaces ⋮ Colouring prime distance graphs ⋮ Lines in hypergraphs ⋮ On the Frankl–Rödl theorem ⋮ Distance graphs with large chromatic number and without large cliques ⋮ On the chromatic number of subsets of the Euclidean plane ⋮ On the combinatorial problems which I would most like to see solved ⋮ On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes ⋮ On the chromatic number of \(\mathbb R^4\) ⋮ On independence numbers of distance graphs with vertices in \(\{-1,0,1\}^n\): estimates, conjectures, and applications to the Nelson-Erdős-hadwiger problem and the borsuk problem ⋮ Circular chromatic numbers of distance graphs with distance sets missing multiples ⋮ Coloring the \(n\)-smooth numbers with \(n\) colors ⋮ Problems related to a de Bruijn-Erdös theorem ⋮ The chromatic number of the space $( {\mathbb R}^n, l_1)$ ⋮ Hedetniemi's conjecture for uncountable graphs ⋮ Colorings of spaces, and random graphs ⋮ Rado's Selection Principle: Applications to binary relations, graph and hypergraph colorings and partially ordered sets ⋮ Connectivity of distance graphs ⋮ Borsuk's partition problem and finite point sets ⋮ Distance graphs with large chromatic numbers and small clique numbers ⋮ One problem on geometric Ramsey numbers ⋮ Products of unit distance graphs ⋮ Unnamed Item ⋮ Axiom of choice and chromatic number of \(R^n\) ⋮ Amorphe Potenzen kompakter Räume ⋮ The chromatic number of infinite graphs - A survey ⋮ Chromatic numbers of spheres ⋮ R.e. Prime powers and total rigidity ⋮ Cycle double covers of infinite planar graphs ⋮ Generalizations of independence and chromatic numbers of a graph ⋮ Around Borsuk's hypothesis ⋮ Chromatic numbers of metric spaces ⋮ The combinatorics of N. G. de Bruijn ⋮ Bounding the distinguishing number of infinite graphs and permutation groups ⋮ The coloring of the cozero-divisor graph of a commutative ring ⋮ Coloring the Voronoi tessellation of lattices ⋮ Images of rigid digraphs ⋮ An index theory for uniformly locally finite graphs ⋮ Ein Satz über die Menge aller Färbungen eines endlich färbbaren Graphen ⋮ Additive \(k\)-colorable extensions of the rational plane ⋮ Erdős and Rényi conjecture ⋮ All unit-distance graphs of order 6197 are 6-colorable ⋮ Intuitionism: an inspiration? ⋮ Measurable chromatic number of geometric graphs and sets without some distances in Euclidean space ⋮ Improved Frankl-Rödl theorem and some of its geometric consequences ⋮ A selection lemma ⋮ Bounds on the measurable chromatic number of \({\mathbb{R}}\) ⋮ Distances realized by sets covering the plane
This page was built for publication:
