scientific article
From MaRDI portal
Publication:3464534
zbMath1338.52019MaRDI QIDQ3464534
Publication date: 27 January 2016
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (52)
On chromatic numbers of close-to-Kneser distance graphs ⋮ Lower bounds for the chromatic numbers of distance graphs with large girth ⋮ Independence numbers of random subgraphs of a distance graph ⋮ On computational complexity of length embeddability of graphs ⋮ 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 ⋮ On the minimal number of edges in induced subgraphs of special 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 ⋮ Turán type results for distance graphs ⋮ On chromatic numbers of nearly Kneser distance graphs ⋮ On simplices in diameter graphs in \(\mathbb{R}^4\) ⋮ 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 ⋮ Unnamed Item ⋮ Chromatic number of a line with geometric progressions of forbidden distances and the complexity of recognizing distance graphs ⋮ Diameters of random distance graphs ⋮ On threshold probabilities for the realization of a random graph by a geometric graph ⋮ On a Frankl-Wilson theorem ⋮ Chromatic numbers of some distance graphs ⋮ Estimate of the number of edges in special subgraphs of a distance graph ⋮ On the partition of plane sets into 6 subsets of small diameter ⋮ Lower bound on the minimum number of edges in subgraphs of Johnson graphs ⋮ On the chromatic numbers corresponding to exponentially Ramsey sets ⋮ On the stability of the independence number of a random subgraph ⋮ On the Frankl–Rödl theorem ⋮ On stability of the independence number of a certain distance graph ⋮ 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 ⋮ On the stability of some Erdős-Ko-Rado type results ⋮ The chromatic number of space with forbidden regular simplex ⋮ On dividing sets into parts of smaller diameter ⋮ On the chromatic numbers of small-dimensional Euclidean spaces ⋮ Chromatic numbers of spheres ⋮ Exponentially Ramsey sets ⋮ Distance graphs with large chromatic number and without cliques of given size in the rational space ⋮ On threshold probability for the stability of independent sets in distance graphs ⋮ Chromatic numbers of distance graphs without short odd cycles in rational spaces ⋮ Bounds on Borsuk numbers in distance graphs of a special type ⋮ 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 ⋮ Clique chromatic numbers of intersection graphs ⋮ A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\) ⋮ The number of edges in induced subgraphs of some distance graphs ⋮ Improved Frankl-Rödl theorem and some of its geometric consequences ⋮ Clique numbers of random subgraphs of some distance graphs ⋮ New Turán type bounds for Johnson graphs ⋮ Counterexamples to Borsuk's conjecture with large girth ⋮ Spectrum of Johnson graphs ⋮ Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\)
This page was built for publication:
