The following pages link to The Mathematical Coloring Book (Q3508582):
Displaying 50 items.
- Independence numbers and chromatic numbers of some distance graphs (Q259909) (← links)
- On the measurable chromatic number of a space of dimension \(n \leq 24\) (Q265996) (← links)
- On some problems of Euclidean Ramsey theory (Q276454) (← links)
- Better bounds for planar sets avoiding unit distances (Q282753) (← links)
- On large subgraphs with small chromatic numbers contained in distance graphs (Q289740) (← links)
- Independence numbers of random subgraphs of a distance graph (Q296011) (← links)
- Symplectic dilations, Gaussian states and Gaussian channels (Q308213) (← links)
- On the number of edges in induced subgraphs of a special distance graph (Q325666) (← links)
- Independence numbers of random subgraphs of distance graphs (Q325669) (← links)
- A new estimate for the number of edges in induced subgraphs of a special distance graph (Q327309) (← links)
- A 4-dimensional graph has at least 9 edges (Q385728) (← links)
- Coloring Hanoi and Sierpiński graphs (Q411656) (← links)
- Weak Schur numbers and the search for G. W. Walker's lost partitions (Q418311) (← links)
- On the chromatic number of \(\mathbb R^4\) (Q464746) (← links)
- Spectral bounds for the independence ratio and the chromatic number of an operator (Q466129) (← links)
- Improvement of the Frankl-Rödl theorem on the number of edges in hypergraphs with forbidden cardinalities of edge intersections (Q483655) (← links)
- 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 (Q492207) (← links)
- Nonrepetitive colorings of line arrangements (Q499479) (← links)
- Upper and lower densities have the strong Darboux property (Q503735) (← links)
- On a generalization of the Hadwiger-Nelson problem (Q522309) (← links)
- Lower bound for the chromatic number of a rational space with metric \(l_u\) and with one forbidden distance (Q679870) (← links)
- The chromatic number of space with forbidden regular simplex (Q679877) (← links)
- The fractional chromatic number of the plane (Q722307) (← links)
- Hamiltonian paths in distance graphs (Q745636) (← links)
- On the maximal number of edges in a uniform hypergraph with one forbidden intersection (Q892713) (← links)
- On lower bounds for the chromatic number of sphere (Q892738) (← links)
- Causality, influence, and computation in possibly disconnected synchronous dynamic networks (Q897391) (← links)
- F. P. Ramsey: the theory, the myth, and the mirror (Q906019) (← links)
- The chromatic number of the plane: the bounded case (Q927877) (← links)
- On the chromatic numbers of rational spaces (Q1646347) (← links)
- Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets (Q1646366) (← links)
- Diameters of random distance graphs (Q1687985) (← links)
- A dimension 6 graph with minimum edge-set (Q1696543) (← links)
- A result in asymmetric Euclidean Ramsey theory (Q1709554) (← links)
- Distance graphs with large chromatic numbers and small clique numbers (Q1761033) (← links)
- Axiom of choice and chromatic number of \(R^n\) (Q1775552) (← links)
- Chromatic numbers of spheres (Q1783626) (← links)
- Chromatic numbers of algebraic hypergraphs (Q1990885) (← links)
- Borsuk's partition problem and finite point sets (Q1992189) (← links)
- Triangle colorings require at least seven colors (Q2032735) (← links)
- New Turán type bounds for Johnson graphs (Q2068827) (← links)
- Algebraic characterizations of some relative notions of size (Q2070971) (← links)
- Exact algorithms for counting 3-colorings of graphs (Q2081467) (← links)
- Embedding Euclidean distance graphs in \(\mathbb{R}^n\) and \(\mathbb{Q}^n\) (Q2172834) (← links)
- The chromatic number of the plane is at least 5: a new proof (Q2189746) (← links)
- On a Frankl-Wilson theorem (Q2190926) (← links)
- Estimate of the number of edges in special subgraphs of a distance graph (Q2191968) (← links)
- On the chromatic numbers corresponding to exponentially Ramsey sets (Q2202680) (← links)
- Minimal graphs with respect to geometric distance realizability (Q2214306) (← links)
- A universal partition result for infinite homogeneous \(K_n\)-free and related graphs (Q2219943) (← links)
