Several Directions of Computer-Aided Investigations in Combinatorics and Geometry

Authors

  • Андрей Михайлович Райгородский MIPT (SU), Mosсow, Russia

Keywords:

distance graph, graph of diameters, Ramsey number, chromatic number, Borsuk’s problem

Abstract

Andrey M. Raigorodskiy: In the paper we present some classical problems of combinatorics, which admit computer-aided solutions. Among these problems, we have Borsuk’s problem on partitioning sets into parts of smaller diameter and problems of Ramsey theory.

Author Biography

  • Андрей Михайлович Райгородский, MIPT (SU), Mosсow, Russia

    Laboratory of advanced combinatorics and network applications: department of discrete mathematics; mechanics and mathematics faculty, department of mathematical statistics and random processes MIPT (SU)

Downloads

Published

2017-06-03

Issue

No. 3 (2016)

Section

Unsolved Problems for Young Scientists

License

Copyright (c) 2017 Андрей Михайлович Райгородский

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Public offer

How to Cite

[1]
А. М. Райгородский, “Several Directions of Computer-Aided Investigations in Combinatorics and Geometry”, Comput. Tools Educ., no. 3, pp. 25–31, Jun. 2017, Accessed: Oct. 31, 2026. Available: http://cte.eltech.ru/ojs/index.php/kio/article/view/1399