The Mathematical Coloring Book
From MaRDI portal
Publication:3508582
DOI10.1007/978-0-387-74642-5zbMath1221.05001OpenAlexW4253040371MaRDI QIDQ3508582
Publication date: 1 July 2008
Full work available at URL: https://doi.org/10.1007/978-0-387-74642-5
graph coloringRamsey theorychromatic number of the planecoloring mapscolored integerscolored polygons
History of mathematics in the 20th century (01A60) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) History of combinatorics (05-03)
Related Items (only showing first 100 items - show all)
On the measurable chromatic number of a space of dimension \(n \leq 24\) ⋮ On some problems of Euclidean Ramsey theory ⋮ Lower bounds for the chromatic numbers of distance graphs with large girth ⋮ 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 ⋮ Computation of new diagonal graph Ramsey numbers ⋮ Symplectic dilations, Gaussian states and Gaussian channels ⋮ From the quantum approximate optimization algorithm to a quantum alternating operator ansatz ⋮ Turán-type results for distance graphs in an infinitesimal plane layer ⋮ 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 ⋮ On the chromatic numbers of rational spaces ⋮ Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets ⋮ Colourful categories ⋮ Independence numbers and chromatic numbers of the random subgraphs of some distance graphs ⋮ New applications of the polynomial method: The cap set conjecture and beyond ⋮ The Schur degree of additive sets ⋮ Embedding Euclidean distance graphs in \(\mathbb{R}^n\) and \(\mathbb{Q}^n\) ⋮ Hilbert’s Proof of His Irreducibility Theorem ⋮ Another Memorable Mongolian Olympiad Problem: A Two-Colored Rectangular Lattice ⋮ Same graph, different universe ⋮ On the chromatic number of an infinitesimal plane layer ⋮ Improvements of the Frankl-Rödl theorem and geometric consequences ⋮ Turán-type bounds for distance graphs ⋮ A 4-dimensional graph has at least 9 edges ⋮ Unnamed Item ⋮ A recursive Lovász theta number for simplex-avoiding sets ⋮ Diameters of random 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 ⋮ The chromatic number of the plane is at least 5: a new proof ⋮ Special cases and equivalent forms of Katznelson's problem on recurrence ⋮ On a Frankl-Wilson theorem ⋮ Estimate of the number of edges in special subgraphs of a distance graph ⋮ Coloring Hanoi and Sierpiński graphs ⋮ Causality, influence, and computation in possibly disconnected synchronous dynamic networks ⋮ Weak Schur numbers and the search for G. W. Walker's lost partitions ⋮ On the notions of upper and lower density ⋮ A dimension 6 graph with minimum edge-set ⋮ Clique numbers of finite unit-quadrance graphs ⋮ Odd wheels are not odd-distance graphs ⋮ F. P. Ramsey: the theory, the myth, and the mirror ⋮ On the chromatic numbers corresponding to exponentially Ramsey sets ⋮ How (Maximally) Contextual Is Quantum Mechanics? ⋮ A result in asymmetric Euclidean Ramsey theory ⋮ On the Frankl–Rödl theorem ⋮ On the chromatic number of subsets of the Euclidean plane ⋮ Minimal graphs with respect to geometric distance realizability ⋮ On the chromatic number of \(\mathbb R^4\) ⋮ A universal partition result for infinite homogeneous \(K_n\)-free and related graphs ⋮ Spectral bounds for the independence ratio and the chromatic number of an operator ⋮ The chromatic number of the plane: the bounded case ⋮ A Topologically Complete Theory of Weaving ⋮ Polynomial configurations in sets of positive upper density over local fields ⋮ Improvement of the Frankl-Rödl theorem on the number of edges in hypergraphs with forbidden cardinalities of edge intersections ⋮ On the Computational Complexity of Degenerate Unit Distance Representations of Graphs ⋮ 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 ⋮ 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 ⋮ Chromatic numbers of algebraic hypergraphs ⋮ Borsuk's partition problem and finite point sets ⋮ On a generalization of the Hadwiger-Nelson problem ⋮ Kaleidoscopical configurations ⋮ Distance graphs with large chromatic numbers and small clique numbers ⋮ Axiom of choice and chromatic number of \(R^n\) ⋮ Chromatic numbers of spheres ⋮ Semialgebraic graphs having countable list-chromatic numbers ⋮ The fractional chromatic number of the plane ⋮ On threshold probability for the stability of independent sets in distance graphs ⋮ Triangle colorings require at least seven colors ⋮ ORTHOGONAL COLORINGS OF THE SPHERE ⋮ Hypercube related polytopes ⋮ Hamiltonian paths in distance graphs ⋮ Finite $\epsilon$-unit distance graphs ⋮ A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space ⋮ The Hadwiger–Nelson Problem ⋮ 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 ⋮ New Turán type bounds for Johnson graphs ⋮ Algebraic characterizations of some relative notions of size ⋮ On the density of sets avoiding parallelohedron distance 1 ⋮ Exact algorithms for counting 3-colorings of graphs ⋮ Counterexamples to Borsuk's conjecture with large girth ⋮ All finite sets are Ramsey in the maximum norm ⋮ 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 ⋮ Odd Wheels Are Not Odd-distance Graphs ⋮ 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 ⋮ On the independence number of $(3, 3)$-Ramsey graphs and the Folkman number $F_e(3, 3; 4)$ ⋮ Independence numbers and chromatic numbers of some distance graphs ⋮ New lower bounds for the chromatic number of a space with forbidden isosceles triangles
This page was built for publication: The Mathematical Coloring Book
