• A
  • A
  • A
  • АБВ
  • АБВ
  • АБВ
  • A
  • A
  • A
  • A
  • A
Обычная версия сайта
  • RU
  • EN
  • HSE University
  • Publications
  • Articles
  • О количестве независимых и k-доминирующих множеств в графах со средней степенью вершин не более k
  • 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 9, 2026
‘Balkan Hospitality Opens Doors: Studying Dialects on the Verge of Extinction
You cannot study spoken dialects from books. Instead, you need to go to a village, seek out its elders, and earn the trust of local residents before you can record hours of spontaneous stories. This is how Natalia Muravleva, Associate Professor at the Faculty of Humanities, conducts her research. Her internship in Serbia continued her long-standing study of dialects spoken by Macedonian settlers. In this interview, she discusses how diaspora cultural centres help researchers reach informants, why native speakers need to be interviewed only in their own language (otherwise, as she puts it, they may 'break'), and how a single field season helped her finalise her monograph. She also shares warm memories of autumn in Belgrade and of colleagues with whom grammar can be discussed in three languages at once.
September 9, 2026
Scientists Train Neural Network to Generate Process Plans from 3D Models
Researchers at the HSE FCS AI and Digital Science Institute have developed CAD2TechSpec, a framework that converts 3D models of mechanical parts into machining process plans—step-by-step instructions for machine tools. The solution aims to reduce the time required for the design and preparation of technical process documentation in mechanical engineering, aircraft manufacturing, and other high-tech industries. The study findings have been published in PeerJ Computer Science.
September 7, 2026
Biologists Discover 'Molecular Fingerprint' of Preeclampsia
Researchers at HSE University employed a new method to model hypoxia in placental cells during pregnancies complicated by preeclampsia and identified molecular markers of tissue hypoxia. Since hypoxia is one of the key mechanisms underlying preeclampsia, these findings are important for a more accurate and timely diagnosis of the disease and for the development of effective treatment methods. The paper has been published in Placenta.

 

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

?

О количестве независимых и k-доминирующих множеств в графах со средней степенью вершин не более k

Математический сборник. 2023. Т. 214. № 11. С. 133–156.
Taletskii D.
Research target: Mathematics
Language: Russian
Full text
DOI
Text on another site
Keywords: независимое множествоenumerative combinatoricsdominating setперечислительная комбинаторикаindependent setk-dominating setдоминирующее множествоk-доминирующее множество
Publication based on the results of:
Research on graph and network structures and its applications (2023)
Similar publications
Многокритериальные задачи с упорядоченными по важности группами критериев (II). Решающие правила
Podinovskiy V. V., Нелюбин А. П., Автоматика и телемеханика 2026 № 8 С. 110–123
Для многокритериальных задач принятия решений по аналогии с качественной вероятностью введены понятия полной и частичной качественной важности как бинарных отношений, обладающих постулируемыми свойствами. Предложено новое определение отношения нестрогого предпочтения на множестве вариантов решений, порождаемое качественной важностью. Исследованы его свойства. Указаны аналитические правила, позволяющие попарно сравнивать варианты по предпочтительности. Проведено сравнение новых отношений предпочтения с разработанными ранее для задач, ...
Added: September 9, 2026
Теоретические основы и методы анализа решений в условиях неопределенности при качественных оценках вероятностей и предпочтений
Podinovskiy V. V., Нелюбин А. П., Автоматика и телемеханика 2026 № 7 С. 113–126
Рассматриваются задачи принятия решений, когда предпочтения оцениваются в порядковой шкале, а возможности реализации значений неопределенного фактора описываются качественной вероятностью (полной или только частичной). Вводятся определения отношений предпочтения и безразличий на множестве стратегий. Предлагаются простые решающие правила, позволяющие сравнивать стратегии по предпочтительности, и приводятся иллюстративные примеры. ...
Added: September 9, 2026
Degree-based topological co-indices for QSPR modelling of benzenoid hydrocarbons: a comparative computational study
Chemical Papers 2026
Benzenoid hydrocarbons are structurally regular aromatic compounds, which makes them well suited for quantitative structure–property relationship (QSPR) studies. This study presents a QSPR analysis of nineteen benzenoid hydrocarbon species using degree-based topological co-indices. We developed a Python program to compute eleven degree-based topological co-indices from molecular graphs and evaluated their ability to explain variations in ...
Added: September 8, 2026
On phase-lock area parquet in a special slow-fast limit of model of Josephson junction.
Glutsyuk A., / Series arXiv "math". 2026.
B.Josephson (Nobel Prize, 1973) predicted a tunnelling effect for a system of two superconductors separated by a narrow dielectric (such a system is called Josephson junction): existence of a supercurrent through it and equations governing it. The overdamped Josephson junction is modeled by the family of differential equations on the 2-torus, dθdτ=1ω(cosθ+B+Acosτ), which is known as ...
Added: September 8, 2026
On exotic rationally integrable dual billiards I. Complex geometry and type of dynamics.
Glutsyuk A., / Series arXiv "math". 2026.
A planar dual billiard is a planar curve γ equipped with a family (σP)|P∈γ of projective involutions of the projective lines LP tangent to γ at P that fix P. A dual billiard is called rationally integrable, if there exists a rational function R(x,y) of two variables (called first integral) whose restriction to each tangent ...
Added: September 8, 2026
Dynamical systems on torus related to general Heun equations: phase-lock areas and constriction breaking
Alexandrov A., Glutsyuk A., Journal of Differential Equations 2026 Vol. 465 Article 114178
The overdamped Josephson junction in superconductivity theory can be modeled by the family of dynamical systems on the torus, which is known as the RSJ model. This family admits an equivalent description by a family of second-order differential equations: special double confluent Heun equations. In the present paper, we construct two new families of dynamical systems on ...
Added: September 8, 2026
On rationally integrable planar dual and projective billiards
Glutsyuk A., Inventiones Mathematicae 2026 Vol. 245 P. 977–1058
A caustic of a strictly convex planar bounded billiard is a smooth curve whose tangent lines are reflected from the billiard boundary to its tangent lines. The famous Birkhoff Conjecture, studied by many mathematicians, states that if the billiard boundary has an inner neighborhood foliated by closed caustics, then it is an ellipse. In the paper we study ...
Added: September 8, 2026
Rational p-adic Hodge theory for d-de Rham-proper stacks
Prikhodko Artem, Kubrak D., Compositio Mathematica 2026 Vol. 162 No. 6 P. 1377–1438
In this follow-up paper we show that smooth Hodge-proper stacks over O𝐾 are ℚ𝑝-locally acyclic: namely the natural map between étale ℚ𝑝-cohomology of the algebraic and Raynaud generic fibers is an equivalence. This establishes the ℚ𝑝-case of general conjectures made in D. Kubrak and A. Prikhodko [p-adic Hodge theory for Artin stacks, Mem. Amer. Math. ...
Added: September 7, 2026
Lower Bounds on the Measure of the Support of Positive and Negative Parts of Trigonometric Polynomials
Ismailov A., Constructive Approximation 2026
The measure of the positivity set {x ∈ [0; 2π] | f (x) > 0} of a trigonometric polynomial f  is bounded from below by the Motzkin density. We generalize the bound to polynomials in several variables and almost periodic functions. We then use these generalizations to extend known results on Taikov’s problem. ...
Added: September 7, 2026
Конечные последовательности и перестановки, ими порождаемые
Kucheryavyy P., Математические заметки 2026 Т. 2026 № 120 С. 380–401
В работе изучаются перестановки, возникающие при упорядочивании по возрастанию дробных долей произведений элементов фиксированной целочисленной последовательности на вещественный параметр. Исследуется количество различных перестановок, которые можно получить таким образом при изменении этого параметра от нуля до единицы. ...
Added: September 7, 2026
Относительные аналитические законы взаимности
Осипов Д.В., Математический сборник 2026 Т. 217 № 9 С. 130–146
Изучаются законы взаимности, связанные с комплексными линейными расслоениями на расслоениях на ориентируемые окружности. В частности, доказывается следующий закон взаимности. Пусть B – комплексное многообразие и πi:Mi→B – расслоение на ориентируемые окружности, где индекс i пробегает конечное множество. Пусть Li и Ni – комплексные линейные расслоения на каждом многообразии Mi. Закон взаимности утверждает, что сумма всех элементов (πi)∗(c1(Li)∪c1(Ni)), где (πi)∗ – ...
Added: September 3, 2026
Orbifold Saito theory of A and D type singularities
Basalaev A., Rarovskii A., Journal of Singularities 2026 Vol. 30 P. 61–80
Saito theory associates to an isolated singularity rich structure that plays an important role in mirror symmetry. In this note we construct Saito theory for A and D type Landau-Ginzburg orbifolds. Namely, for the pairs (f,G), where f defines an isolated singularity of A and D type and G is a group of symmetries of ...
Added: September 1, 2026
Non-axiomatizability of modal predicate logics of Dedekind-complete linear orders with constant domains
Rybakov M., Shkatov D., Journal of Logic and Computation 2026 Vol. 36 No. 6 Article exag026
We prove Pi-1-1-hardness, and thus lack of recursive axiomatizability, of constant-domain modal predicate logics defined by a class of Dedekind complete linear Kripke frames containing a frame with an infinitely increasing chain of worlds. The result holds even for the language with one unary predicate letter, one propositional letter, and two individual variables. ...
Added: September 1, 2026
Semi-Interlaced Polytopes
Селянин Ф. И., Moscow Mathematical Journal 2026 Vol. 26 No. 2 P. 167–187
Minkowski mixed volume of n subpolytopes D1,…,Dn of a polytope P⊂Rn clearly does not exceed the normalized volume n!Vol(P). Equality holds if and only if the subpolytopes are interlaced, i.e., each proper face F⊊P intersects at least dim(F)+1 of the polytopes Di. Efficiently computing mixed volumes for more general collections of subpolytopes is crucial for estimating the complexity of numerically solving polynomial systems. Motivated by relaxing the bound dim(F)+1 to dim(F), we ...
Added: August 31, 2026
A new spin on polynomial relations among kappa classes
Kazaryan M., Dunin-Barkowski P., Bychkov B. et al., International Mathematics Research Notices 2026 Vol. 14 Article rnag146
We prove a recent conjecture of the fourth named author with P. Norbury that states a system of universal polynomial relations among the kappa classes on the moduli spaces of algebraic curves. The proof involves localization and materialization analysis of the spin Gromov–Witten theory of the projective line and is dictated by Z 2 -equivariant ...
Added: August 31, 2026
On the minimum number of maximal distance-k independent sets in trees
Taletskii D., / Series arXiv "math". 2026.
A vertex subset of a graph is called a \textit{distance-$k$ independent set} if the distance between any two of its distinct vertices is at least $k + 1$. For all $n,k \geq 1$, we determine the minimum possible number of inclusion-wise maximal distance-$k$ independent sets among all $n$-vertex trees. It equals~$n$ if $n \leq k ...
Added: May 1, 2026
Is Canfield Right? On the Asymptotic Coefficients for the Maximum Antichain of Partitions and Related Counting Inequalities
Ignatov D. I., , in: 11th International Conference, AIST 2023, Yerevan, Armenia, September 28–30, 2023, Revised Selected Papers. Analysis of Images, Social Networks and Texts. Lecture Notes in Computer Science (LNCS, volume 14486).: Cham: Springer, 2024. P. 349 – 361.
This paper dates back to the asymptotic solutions of Rota’s problem on the size of maximum antichain in the set partition lattice by Canfield and Harper and others. The knowledge of asymptotic coefficients could pave the way to the asymptotic solutions of such problems as (maximal) antichain counting in partition lattices. In addition to our ...
Added: January 23, 2026
On the Eternal Domination Number of Planar Graphs with Diameter 2
D. S. Taletskii, Journal of Applied and Industrial Mathematics (перевод журналов "Сибирский журнал индустриальной математики" и "Дискретный анализ и исследование операций") 2025 Vol. 19 No. 1 P. 142–156
An eternal dominating set of a graph is a dominating set D on which mobile guards are initially located (at most one guard is allowed on any vertex). For any infinite sequence of attacks occurring sequentially at vertices, the set D can be modified by moving the guard from an adjacent vertex to the attacked ...
Added: November 26, 2025
The Gamma-Theta Conjecture holds for planar graphs
Taletskii D., / Series arXiv "math". 2024.
The Gamma-Theta Conjecture states that if the domination number of a graph is equal to its eternal domination number, then it is also equal to its clique covering number. This conjecture is known to be true for several graph classes, such as outerplanar graphs, subcubic graphs and Ck-free graphs, where k ∈ {3, 4}. In ...
Added: December 31, 2024
Некоторые полные сложностные дихотомии для задачи о доминирующем множестве
Дахно Г. С., Malyshev D., Математические заметки 2025 Т. 117 № 1 С. 62–78
Наследственный класс — множество обыкновенных графов, замкнутое относительно удаления вершин, каждый такой класс задается множеством своих минимальных запрещенных порожденных подграфов. Задача о доминирующем множестве для заданного графа состоит в том, чтобы определить, а имеется ли в нем такое подмножество вершин заданного размера, что каждая вершина вне подмножества имеет хотя бы одного соседа в данном подмножестве. ...
Added: December 3, 2024
О числе вечного доминирования планарных графов диаметра 2
Taletskii D., Дискретный анализ и исследование операций 2025 Т. 32 № 1 С. 122–144
Вечным доминирующим множеством графа называется доминирующее множество D, на котором располагается первоначально мобильная охрана (не более одного охранника может находиться в каждой вершине). Для любой бесконечной последовательности атак на вершины графа множество D может быть модифицировано путём передвижения охранника со смежной вершины в атакуемую вершину (предполагается, что атакуемая вершина не была занята охранником во время ...
Added: October 5, 2024
О количестве k-доминирующих независимых множеств в планарных графах
Taletskii D., Дискретный анализ и исследование операций 2024 Т. 31 № 1 С. 109–128
The set of graph vertices J_k is called k-dominating independent (k > 1) if its vertices are pairwise adjacent and every vertex not from J_k is adjacent to at least k vertices from J_k. In the presentb paper we obtain new upper bounds for the number of k-dominating independent sets for k > 2 in ...
Added: March 25, 2024
On the number of independent and k-dominating sets in graphs with average vertex degree at most k
D. S. Taletskii, Sbornik Mathematics 2023 Vol. 214 No. 11 P. 1627–1650
The following conjecture is formulated: if the average vertex degree in a graph is not greater than a positive integer k⩾1, then the number of k-dominating sets in this graph does not exceed the number of its independent sets, and these numbers are equal to each other if and only if the graph is k-regular. This conjecture is proved for k∈{1,2}. ...
Added: March 25, 2024
Faster Algorithms for Sparse ILP and Hypergraph Multi-Packing/Multi-Cover Problems
Gribanov D., Shumilov I., Malyshev D. et al., Journal of Global Optimization 2024 Vol. 89 P. 1033–1067
In our paper, we consider the following general problems: check feasibility, count the number of feasible solutions, find an optimal solution, and count the number of optimal solutions in P ∩ Zn , assuming that P is a polyhedron, defined by systems Ax ≤ b or Ax = b, x ≥ 0 with a sparse ...
Added: March 6, 2024
  • 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