scientific article; zbMATH DE number 7319004

zbMath1459.05358MaRDI QIDQ4965840

A. A. Tuzhilin, Alexandr O. Ivanov

Publication date: 10 March 2021

Full work available at URL: http://mathnet.ru/eng/cheb903

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

chromatic numberGromov-Hausdorff distanceminimum spanning treemetric geometryclique coveringBorsuk problemdiscrete optimisation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Extremal problems in graph theory (05C35) Metric spaces, metrizability (54E35) Coloring of graphs and hypergraphs (05C15) Combinatorial aspects of simplicial complexes (05E45)

Related Items

Calculation of the Gromov-Hausdorff distance using the Borsuk number

Uses Software

• gCol

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• A 64-dimensional counterexample to Borsuk's conjecture
• The Gromov-Hausdorff metric on the space of compact metric spaces is strictly intrinsic
• Groups of polynomial growth and expanding maps. Appendix by Jacques Tits
• On Borsuk's conjecture for two-distance sets
• Local structure of Gromov-Hausdorff space, and isometric embeddings of finite metric spaces into this space
• Around Borsuk's hypothesis
• Überdeckung einer Menge durch Mengen kleineren Durchmessers
• Mitteilung betreffend meine Note: Überdeckung einer Menge durch Mengen kleineren Durchmessers
• A counterexample to Borsuk’s conjecture
• A Guide to Graph Colouring
• Drei Sätze über die n-dimensionale euklidische Sphäre
• Isometry Group of Gromov--Hausdorff Space
• Gromov--Hausdorff Distance to Simplexes
• Sets admitting connection by graphs of finite length
• Encyclopedia of Distances