scientific article; zbMATH DE number 5268798
From MaRDI portal
Publication:5301263
zbMath1144.52005MaRDI QIDQ5301263
Publication date: 29 April 2008
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Other problems of combinatorial convexity (52A37) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)
Related Items (27)
Independence numbers of random subgraphs of a distance graph ⋮ 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 ⋮ Independence numbers and chromatic numbers of the random subgraphs of some distance graphs ⋮ On \(k\)-diametral point configurations in Minkowski spaces ⋮ New bounds for the distance Ramsey number ⋮ Borsuk's problem, Boltyanski's illumination problem, and circumradius ⋮ Diameters of random distance graphs ⋮ On the maximal number of edges in a uniform hypergraph with one forbidden intersection ⋮ Estimate of the number of edges in special subgraphs of a distance graph ⋮ New bounds on clique-chromatic numbers of Johnson graphs ⋮ Partition of three-dimensional sets into five parts of smaller diameter ⋮ 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 ⋮ Borsuk's partition problem and finite point sets ⋮ New estimates in the problem of the number of edges in a hypergraph with forbidden intersections ⋮ Zero-one law for random distance graphs with vertices in \(\{-1,0,1\}^n\) ⋮ On threshold probability for the stability of independent sets in distance graphs ⋮ Diameter graphs in \({\mathbb R}^4\) ⋮ Hamiltonian paths in distance graphs ⋮ Systems of representatives ⋮ Small Subgraphs in Random Distance Graphs ⋮ The number of edges in induced subgraphs of some distance graphs ⋮ 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 Schur's conjecture in \(\mathbb R^4\) ⋮ Independence numbers and chromatic numbers of some distance graphs
This page was built for publication:
