• A
  • A
  • A
  • АБВ
  • АБВ
  • АБВ
  • A
  • A
  • A
  • A
  • A
Обычная версия сайта
  • RU
  • EN
  • HSE University
  • Publications
  • Articles
  • On partial descriptions of König graphs for odd paths and all their spanning supergraphs
  • RU
  • EN
Расширенный поиск
Высшая школа экономики
Национальный исследовательский университет
Priority areas
  • business informatics
  • economics
  • engineering science
  • humanitarian
  • IT and mathematics
  • law
  • management
  • mathematics
  • sociology
  • state and public administration
by year
  • 2028
  • 2027
  • 2026
  • 2025
  • 2024
  • 2023
  • 2022
  • 2021
  • 2020
  • 2019
  • 2018
  • 2017
  • 2016
  • 2015
  • 2014
  • 2013
  • 2012
  • 2011
  • 2010
  • 2009
  • 2008
  • 2007
  • 2006
  • 2005
  • 2004
  • 2003
  • 2002
  • 2001
  • 2000
  • 1999
  • 1998
  • 1997
  • 1996
  • 1995
  • 1994
  • 1993
  • 1992
  • 1991
  • 1990
  • 1989
  • 1988
  • 1987
  • 1986
  • 1985
  • 1984
  • 1983
  • 1982
  • 1981
  • 1980
  • 1979
  • 1978
  • 1977
  • 1976
  • 1975
  • 1974
  • 1973
  • 1972
  • 1971
  • 1970
  • 1969
  • 1968
  • 1967
  • 1966
  • 1965
  • 1964
  • 1963
  • 1958
  • More
Subject
News
September 18, 2026
When Pictures Hinder Understanding: Illustrations May Impede Learning of Abstract Ideas
Illustrations can help remember specific actions but do not always make abstract ideas easier to learn. Researchers from HSE University and Humboldt University compared how people learn from texts with different levels of abstractness. They found that participants remembered illustrations better and performed better on related tasks after reading a multimedia text about yoga asanas than after reading an abstract text about the Nash equilibrium. The findings could help improve the selection of illustrations for educational and informational materials. The study has been published in Learning and Instruction.
September 17, 2026
'I Wish That People Would Place Greater Trust in Science'
When Tatiana Eremicheva chose Fundamental and Computational Linguistics as her field of study, she thought it would be about learning languages. Instead, she discovered it was about helping people. In this interview for the HSE Young Scientists project, she discusses science as a way of understanding the world, billiards as a team-building activity, and why learning to read is not always as easy as it seems.
September 15, 2026
Immunity to Chaos: How Personal Resources Help Us Cope with the Challenges of a Turbulent World
International conflicts, crises and digital overload—the modern world puts our minds to the test every day. Traditional psychology often focuses on the consequences: anxiety, depression, and psychosomatic disorders. But what if we looked at the problem differently—through the lens of the resources that prevent us from breaking down? Psychological immunity is precisely this set of resources. Alena Zolotareva and her group, Psychological Immunity as a Resource for Positive Functioning, are developing an integrative model of this phenomenon, adapting diagnostic tools and preparing for large-scale empirical research. Why do psychologists need to collaborate with medical professionals, and how could their research transform preventive care in clinics and corporations?

 

Have you spotted a typo?
Highlight it, click Ctrl+Enter and send us a message. Thank you for your help!

Publications
  • Books
  • Articles
  • Chapters of books
  • Working papers
  • Report a publication
  • Research at HSE

?

On partial descriptions of König graphs for odd paths and all their spanning supergraphs

Optimization Letters. 2022. Vol. 16. No. 2. P. 481–496.
Mokeev D. B., Malyshev D.

We consider graphs, which and all induced subgraphs of which possess the following property: the maximum number of disjoint paths on k vertices equals the minimum cardinality of vertex sets, covering all paths on k vertices. We call such graphs König for the k-path and all its spanning supergraphs. For each odd k, we reveal an infinite family of minimal forbidden subgraphs for them. Additionally, for every odd k, we present a procedure for constructing some of such graphs, based on the operations of adding terminal subgraphs and replacement of edges with subgraphs.

Research target: Mathematics Computer Science
Language: English
Full text
DOI
Text on another site
Keywords: k-path packingconstructive descriptionk-path coverminimal forbidden subgraph
Publication based on the results of:
Theoretical and algorithmic aspects of network analysis algorithms (2021)
Similar publications
Some rigidity results for static three-manifolds with boundary and positive scalar curvature
Medvedev V., Annals of Global Analysis and Geometry 2026 Vol. 70 No. 2 P. 8–23
This paper studies three-dimensional compact static manifolds with boundary and positive scalar curvature. We prove that, under a suitable bound on the Ricci curvature, the orientable quotient of the Nariai static manifold with boundary  is the only such manifold with connected boundary, provided that the zero-level set of the potential is connected and does not intersect ...
Added: September 19, 2026
Improving the Accuracy of Automatic Wildlife Detection in Nature Reserves Using Infrared Imaging
Aleksei Samarin, Alexander Savelev, Aleksei Toropov et al., Pattern Recognition and Image Analysis 2026 Vol. 36 No. 2 P. 323–334
In this paper, an improved approach for automatic wildlife detection in natural environments based on the integration of a neural network architecture with a two-stream attention mechanism and a novel preclassification step based on infrared data has been presented. The proposed method addresses one of the key challenges in environmental monitoring: the need for scalable ...
Added: September 19, 2026
IDAP++: Advancing Divergence-Aware Pruning with Joint Filter and Layer Optimization
Aleksei Samarin, Nazarenko A., Kotenko E. et al., Proceedings of the ACM on Management of Data, USA 2026 Vol. 4 No. 1 P. 1–28
Modern knowledge and large volumes of data are increasingly encoded within neural networks, making the task of simplifying their structures and reducing the number of parameters especially relevant, both to improve efficiency and to facilitate deployment in resource-constrained environments. This paper presents a novel approach to neural network compression that addresses redundancy at both the ...
Added: September 19, 2026
Automated Feature Engineering-Based Approach for Micrococci Microscopic Image Classification and Taxonomic Characteristics Determination
Aleksei Samarin, Alexander Savelev, Aleksei Toropov et al., Pattern Recognition and Image Analysis 2025 Vol. 35 No. 2 P. 148–158
This paper describes our research on creating classifiers for microbial images (micrococci microscopy images) obtained from pictures of unfixed microscopic scenes. In our work, we propose an AutoML approach based on the automatic generation and analysis of the feature space for constructing the most optimal descriptors of microorganism images for subsequent classification. This makes it ...
Added: September 19, 2026
Improvement in Microbial Classification Quality Using Synthetic Microscopic Images Generated by Large Visual-Language Models
Aleksei Samarin, Alexander Savelev, Aleksei Toropov et al., Pattern Recognition and Image Analysis 2026 Vol. 36 No. 2 P. 302–312
The lack of annotated microscopic datasets remains a major obstacle to training robust deep learning models for microbial classification. In this paper, a novel data augmentation pipeline that uses visual–linguistic large-scale models to generate synthetic microscopic images of six different bacterial and nonbacterial classes has been proposed. Synthetic samples have gradually been added to the ...
Added: September 19, 2026
Advances in Neural Computation, Machine Learning, and Cognitive Research IX
Springer, Cham, 2026.
computer vision ...
Added: September 19, 2026
Proceedings of 18th International Conference on Machine Learning and Computing
Springer, Cham, 2026.
Added: September 19, 2026
Proceedings of the 35th Conference of Open Innovations Association FRUCT
FRUCT Oy, 2024.
Added: September 19, 2026
Proceedings of the 36th Conference of Open Innovations Association FRUCT
FRUCT Oy, 2024.
Added: September 19, 2026
Proceedings of the 37th Conference of Open Innovations Association FRUCT
FRUCT Oy, 2025.
Added: September 19, 2026
Proceedings of the 39th Conference of Open Innovations Association FRUCT
FRUCT Oy, 2026.
Added: September 19, 2026
Flow-Guided Neural Pruning: Signal-Flow Framework for Multi-Architecture Model Compression
Aleksei Samarin, Nazarenko A., Kotenko E. et al., Machine Learning and Knowledge Extraction 2026 Vol. 8 No. 8 P. 1–26
This paper presents a novel method for pruning deep neural networks based on the concept of flow, derived from the continuous modeling of signal propagation across layers. We derive flow functions for fully connected, convolutional, and self-attention architectures, and we propose a new iterative pruning algorithm, Iterative Flow-Aware Pruning (IFAP), that leverages these measures to ...
Added: September 19, 2026
Классы Гёльдера в L^p-норме на chord-arc кривой в R^3
Alexeeva T., Shirokov N. A., Алгебра и анализ 2022 Т. 34 № 4 С. 1–21
We define Holder classes L^p_α(L) in the L^p(L) norm on a chord-arc curve L in R^3 and prove direct and inverse approximation theorems for functions from these classes by functions harmonic in a neighborhood of the curve. The approximation is estimated in the L^p(L) norm, and the smaller the neighborhood, the more accurate the approximation. ...
Added: September 19, 2022
A polynomial-time algorithm of finding a minimum k-path vertex cover and a maximum k-path packing in some graphs
Mokeev D. B., Malyshev D., Optimization Letters 2020 Vol. 14 No. 6 P. 1317–1322
For a graph G and a positive integer k, a subset C of vertices of G is called a k-path vertex cover if C intersects all paths of k vertices in G. The cardinality of a minimum k-path vertex cover is denoted by β_{P_k}(G). For a graph G and a positive integer k, a subset ...
Added: March 12, 2020
Constructive Description of H{\"o}lder-like Classes on an Arc in $\mathbb{R}^3$ by Means of Harmonic Functions
Tatyana A. Alexeeva, Nikolay A. Shirokov, Journal of Approximation Theory 2020 Vol. 249 Article 105308
Functional classes on a curve in a plane (a partial case of a spatial curve) can be described by the approximation speed by functions that are harmonic in three-dimensional neighbourhoods of the curve. No constructive description of functional classes on rather general surfaces in R3 and R4 has been presented in literature so far. The main result of the paper ...
Added: October 30, 2019
  • About
  • About
  • Key Figures & Facts
  • Sustainability at HSE University
  • Faculties & Departments
  • International Partnerships
  • Faculty & Staff
  • HSE Buildings
  • HSE University for Persons with Disabilities
  • Public Enquiries
  • Studies
  • Admissions
  • Programme Catalogue
  • Undergraduate
  • Graduate
  • Exchange Programmes
  • Summer University
  • Summer Schools
  • Semester in Moscow
  • Business Internship
  • Research
  • International Laboratories
  • Research Centres
  • Research Projects
  • Monitoring Studies
  • Conferences & Seminars
  • Academic Jobs
  • Yasin (April) International Academic Conference on Economic and Social Development
  • Media & Resources
  • Publications by staff
  • HSE Journals
  • Publishing House
  • iq.hse.ru: commentary by HSE experts
  • Library
  • Economic & Social Data Archive
  • Video
  • HSE Repository of Socio-Economic Information
  • HSE1993–2026
  • Contacts
  • Copyright
  • Privacy Policy
  • Site Map
Edit