The book "Algorithmic research in combinatorics (a collection of articles)" edited by I. A. Farajeva and other authors is a unique collection of scientific works devoted to topical issues of combinatorial theory and algorithmic methods. This collection will be a real find for students, graduate students and researchers interested in mathematics, computer science and related disciplines. Combinatorics, as a science, studies the ways in which objects are selected, arranged, and combined, and in recent decades has become an integral part of many fields, including graph theory, optimization, and information theory. This collection presents articles that cover a wide range of topics, from classical problems to modern algorithmic approaches. The reader will be able to immerse himself in a world of complex mathematical models and algorithms that find application in various fields, such as computer science, bioinformatics and even economics. Who can like this collection? First of all, it will be of interest to students and graduate students studying mathematics and computer science, as well as teachers who are looking for relevant materials for their courses . Researchers working in the field of combinatorics and algorithmic methods will find here useful ideas and fresh approaches that can become the basis for their own research. In addition, the book will be of interest to practitioners working in the IT field who seek to apply theoretical knowledge to real-world problems. The topics raised in the collection cover both theoretical aspects and practical applications of algorithms in combinatorics. The reader will be able to learn about new methods of solving combinatorial problems, how algorithms can help in optimizing processes and how combinatorial approaches are applied in various fields of science and technology. These studies emphasize the importance of algorithmic approaches in solving complex problems, which makes the book especially valuable for those who seek to be at the forefront of scientific progress. The style of the authors is distinguished by clarity and accessibility, which allows readers with different levels of training to easily absorb the material presented. and . A. Farajev, as editor and one of the authors, is known for his work in graph theory and combinatorics, and his contribution to the collection gives him added value. Readers familiar with his previous work will be able to appreciate the depth and originality of the research presented. If you are looking for literature that combines theory and practice, and seek to expand your knowledge in combinatorics and algorithms, then "Algorithmic Research in Combinatorics" will be an excellent choice for you. This book will not only enrich your scientific outlook, but also inspire new ideas and research. Do not miss the opportunity to immerse yourself in the world of combinatorics and discover its endless possibilities!