The Mathematical Coloring Book
From MaRDI portal
Publication:3508582
DOI10.1007/978-0-387-74642-5zbMath1221.05001MaRDI QIDQ3508582
Publication date: 1 July 2008
Full work available at URL: https://doi.org/10.1007/978-0-387-74642-5
graph coloring; Ramsey theory; chromatic number of the plane; coloring maps; colored integers; colored polygons
01A60: History of mathematics in the 20th century
05C15: Coloring of graphs and hypergraphs
05C55: Generalized Ramsey theory
05-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics
05-03: History of combinatorics
Related Items
Unnamed Item, An adaptive upper bound on the Ramsey numbers $R(3,\dots,3)$, Unnamed Item, Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii, On Some Open Questions for Ramsey and Folkman Numbers, Some of My Favorite Coloring Problems for Graphs and Digraphs, An Introduction to Temporal Graphs: An Algorithmic Perspective*, On Single-Distance Graphs on the Rational Points in Euclidean Spaces, Still Spinning: The Moser Spindle at Sixty, Coloring distance graphs on the plane, Almost-monochromatic sets and the chromatic number of the plane, A triangle-free, 4-chromatic \(\mathbb{Q}^3\) Euclidean distance graph Scavenger hunt!, New directions in real algebraic geometry. Abstracts from the workshop held March 19--24, 2023, Two-Colorings of Normed Spaces without Long Monochromatic Unit Arithmetic Progressions, Chromatic coloring of distance graphs, III, On the chromatic number of 2-dimensional spheres, Towards the Chen-Raspaud conjecture, Chromatic numbers of Cayley graphs of abelian groups: a matrix method, Max-norm Ramsey theory, New applications of the polynomial method: The cap set conjecture and beyond, Hilbert’s Proof of His Irreducibility Theorem, Another Memorable Mongolian Olympiad Problem: A Two-Colored Rectangular Lattice, On the chromatic number of an infinitesimal plane layer, On the Frankl–Rödl theorem, Hypercube related polytopes, Unnamed Item, All finite sets are Ramsey in the maximum norm, Odd Wheels Are Not Odd-distance Graphs, Computation of new diagonal graph Ramsey numbers, A recursive Lovász theta number for simplex-avoiding sets, On the notions of upper and lower density, How (Maximally) Contextual Is Quantum Mechanics?, A Topologically Complete Theory of Weaving, Independence numbers and chromatic numbers of some distance graphs, On the measurable chromatic number of a space of dimension \(n \leq 24\), On some problems of Euclidean Ramsey theory, Better bounds for planar sets avoiding unit distances, On large subgraphs with small chromatic numbers contained in distance graphs, Independence numbers of random subgraphs of a distance graph, Symplectic dilations, Gaussian states and Gaussian channels, On the number of edges in induced subgraphs of a special distance graph, Independence numbers of random subgraphs of distance graphs, A new estimate for the number of edges in induced subgraphs of a special distance graph, A 4-dimensional graph has at least 9 edges, Coloring Hanoi and Sierpiński graphs, Weak Schur numbers and the search for G. W. Walker's lost partitions, On the chromatic number of \(\mathbb R^4\), Spectral bounds for the independence ratio and the chromatic number of an operator, Improvement of the Frankl-Rödl theorem on the number of edges in hypergraphs with forbidden cardinalities of edge intersections, Improvements of the Frankl-Rödl theorem on the number of edges of a hypergraph with forbidden intersections, and their consequences in the problem of finding the chromatic number of a space with forbidden equilateral triangle, Nonrepetitive colorings of line arrangements, Upper and lower densities have the strong Darboux property, On a generalization of the Hadwiger-Nelson problem, Lower bound for the chromatic number of a rational space with metric \(l_u\) and with one forbidden distance, The chromatic number of space with forbidden regular simplex, The fractional chromatic number of the plane, Hamiltonian paths in distance graphs, On the maximal number of edges in a uniform hypergraph with one forbidden intersection, On lower bounds for the chromatic number of sphere, Causality, influence, and computation in possibly disconnected synchronous dynamic networks, F. P. Ramsey: the theory, the myth, and the mirror, The chromatic number of the plane: the bounded case, On the chromatic numbers of rational spaces, Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets, Diameters of random distance graphs, A dimension 6 graph with minimum edge-set, A result in asymmetric Euclidean Ramsey theory, Distance graphs with large chromatic numbers and small clique numbers, Axiom of choice and chromatic number of \(R^n\), Chromatic numbers of spheres, Chromatic numbers of algebraic hypergraphs, Borsuk's partition problem and finite point sets, Triangle colorings require at least seven colors, New Turán type bounds for Johnson graphs, Algebraic characterizations of some relative notions of size, Exact algorithms for counting 3-colorings of graphs, Embedding Euclidean distance graphs in \(\mathbb{R}^n\) and \(\mathbb{Q}^n\), The chromatic number of the plane is at least 5: a new proof, On a Frankl-Wilson theorem, Estimate of the number of edges in special subgraphs of a distance graph, On the chromatic numbers corresponding to exponentially Ramsey sets, Minimal graphs with respect to geometric distance realizability, A universal partition result for infinite homogeneous \(K_n\)-free and related graphs, Polynomial configurations in sets of positive upper density over local fields, Kaleidoscopical configurations, On threshold probability for the stability of independent sets in distance graphs, A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space, On lower bounds for the chromatic number of spheres, A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\), Proof of van der Waerden's theorem in nine figures, Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles, The number of edges in induced subgraphs of some distance graphs, On the density of sets avoiding parallelohedron distance 1, Counterexamples to Borsuk's conjecture with large girth, New upper bounds for the independence numbers of graphs with vertices in \(\{-1,0,1\}^n\) and their applications to problems of the chromatic numbers of distance graphs, On large subgraphs of a distance graph which have small chromatic number, About an Erdős-Grünbaum conjecture concerning piercing of non-bounded convex sets, New upper bound for the chromatic number of a random subgraph of a distance graph, New lower bound for the chromatic number of a rational space with one and two forbidden distances, New lower bounds for the chromatic number of a space with forbidden isosceles triangles, Lower bounds for the chromatic numbers of distance graphs with large girth, Same graph, different universe, Improvements of the Frankl-Rödl theorem and geometric consequences, Turán-type bounds for distance graphs, On the chromatic number of subsets of the Euclidean plane, From the quantum approximate optimization algorithm to a quantum alternating operator ansatz, Turán-type results for distance graphs in an infinitesimal plane layer, The Schur degree of additive sets, Special cases and equivalent forms of Katznelson's problem on recurrence, Clique numbers of finite unit-quadrance graphs, Odd wheels are not odd-distance graphs, Semialgebraic graphs having countable list-chromatic numbers, ORTHOGONAL COLORINGS OF THE SPHERE, The Hadwiger–Nelson Problem, On the Computational Complexity of Degenerate Unit Distance Representations of Graphs, Finite $\epsilon$-unit distance graphs, On the independence number of $(3, 3)$-Ramsey graphs and the Folkman number $F_e(3, 3; 4)$, Colourful categories, Independence numbers and chromatic numbers of the random subgraphs of some distance graphs
