• A
  • A
  • A
  • АБВ
  • АБВ
  • АБВ
  • A
  • A
  • A
  • A
  • A
Обычная версия сайта
  • RU
  • EN
  • HSE University
  • Publications
  • Articles
  • О сильном хроматическом числе случайных гиперграфов
  • 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

?

О сильном хроматическом числе случайных гиперграфов

Доклады Российской академии наук. Математика, информатика, процессы управления (ранее - Доклады Академии Наук. Математика). 2022. Т. 502. С. 37–41.
Матвеева Т. Г., Khuzieva A., Shabanov D. A.

The paper deals with the study of the probability threshold for the property of strong colorability with given number of colors of the random k-uniform hypergraph in the binomial model H(n,k,p). A vertex coloring of a hypergraph is said to be strong if any edge does not have two vertices of the same color under it. We study the problem of finding the sharp probability threshold of the existence of a strong coloring with q colors for H(n,k,p). By using the second moment method we obtain very tight bounds for this value provided that q is large enough in comparison with k.

Research target: Mathematics
Language: Russian
Full text
DOI
Text on another site
Keywords: случайные гиперграфыраскраски гиперграфовметод второго моментапороговые вероятностисильное хроматическое число
Similar publications
ФУНДАМЕНТАЛЬНЫЙ ПРИНЦИП ЭЙЛЕРА ДЛЯ ОДНОГО КЛАССА ДИФФЕРЕНЦИАЛЬНЫХ УРАВНЕНИЙ В ЧАСТНЫХ ПРОИЗВОДНЫХ С ПЕРЕМЕННЫМИ КОЭФФИЦИЕНТАМИ
Дильмухаметова Алия Мидхатовна, Напалков В. В., «Doklady Mathematics» 2012 Т. 443 № 3 С. 293–295
В данной работе введены обобщенные частные производные, изучены дифференциальные уравнения в обобщенных частных производных с постоянными коэффициентами и доказан фундаментальный принцип Эйлера для таких уравнений. Устанавливлена связь с классом уравнений в обычных частных производных с переменными коэффициентами. ...
Added: September 21, 2026
Pattern Recognition. ICPR 2024 International Workshops and Challenges
Springer, Cham, 2025.
Added: September 21, 2026
Automation of Multi-Class Microscopy Image Classification Based on the Microorganisms Taxonomic Features Extraction
Aleksei Samarin, Alexander Savelev, Aleksei Toropov et al., Journal of Imaging 2025 Vol. 11 No. 6 P. 1–20
This study presents a unified low-parameter approach to multi-class classification of microorganisms (micrococci, diplococci, streptococci, and bacilli) based on automated machine learning. The method is designed to produce interpretable taxonomic descriptors through analysis of the external geometric characteristics of microorganisms, including cell shape, colony organization, and dynamic behavior in unfixed microscopic scenes. A key advantage ...
Added: September 21, 2026
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
A Bicriteria Fish War Game with Asymmetric Environmental Concern
Kuzyutin D., Smirnova N., Veselkov A., Bulletin of the South Ural State University, Series: Mathematical Modelling, Programming and Computer Software 2026 Vol. 19 No. 3 P. 40–49
We consider spatial dynamic fishery management problem taking into account the resource migration process between an open-access fishing area and no-take marine protected area. The introduced extension of a standard single-criterion fish war game implies that each player aims to maximize simultaneously two performance criteria which present an economic benefit and an environmental conservation goal ...
Added: September 18, 2026
Четырехмерные гиперэллиптические многообразия, определяемые векторными раскрасками простых многогранников
Ероховец Николай Юрьевич, Математический сборник 2026 Т. 217 № 5 С. 45–89
Toric topology assigns to each simple convex n-polytope P with m facets an n-dimensional real moment-angle manifold RZP with a canonical action of Zm2=(Z/2Z)m. We consider (not necessarily free) actions of subgroups H⊂Zm2 on RZP. The orbit space N(P,H)=RZP/H carries an action of Zm2/H. For general n we introduce the notion of Hamiltonian C(n,k)-subcomplex in the boundary of an ...
Added: September 17, 2026
Explicit bases for Riemann-Roch spaces on elliptic curves and their application in constructing various elliptic code families
Kuninets A., Malygina E., Cryptography and Communications 2026
In this paper, we determine explicit bases for Riemann–Roch spaces associated with various families of elliptic codes. We establish the feasibility and provide exact algorithms for constructing bases of Riemann–Roch spaces corresponding to arbitrary divisors on elliptic curves, including the non-effective case. These results are subsequently applied to derive bases for quasi-cyclic elliptic codes and ...
Added: September 17, 2026
Universality of robust chaotic dynamics in a family of one-dimensional Lorenz maps
Kazakov A., Koryakin V., Safonov K. et al., Journal of Differential Equations 2026 Vol. 480 Article 114626
We study a family of one-dimensional maps that models the dynamics of a system of differential equations with a Lorenz attractor near a bifurcation curve where the system has a pair of homoclinic loops with zero separatrix value. Of particular interest is the region of the parameter plane where the map has a robust chaotic ...
Added: September 16, 2026
Пороговые вероятности для раскрасок случайных гиперграфов
Кошелев М. М., Shabanov D. A., Шайхеева Т. М., Успехи математических наук 2025 Т. 80 № 1(481) С. 161–162
In the paper we obtain new estimates of threshold probabilities for the properties of fractional (r:2)-colorings of a random hypergraph in the binomial model H(n,k,p). ...
Added: February 4, 2025
О структуре множества полноцветных раскрасок случайного гиперграфа
Tiapkin D., Shabanov D. A., Доклады Российской академии наук. Математика, информатика, процессы управления (ранее - Доклады Академии Наук. Математика) 2023 Т. 512 № 1 С. 52–57
The paper deals with the structure of the set of panchromatic colorings with three colors of a random hypergraph in the uniform model $H(n,k,m)$. It is well known that the property of the existence of a panchromatic coloring with given number of colors $r$ has the sharp threshold, i.e. there exists the threshold value $\widehat{m}_r=\widehat{m}_r(n)$ ...
Added: November 30, 2023
Дробные раскраски случайных гиперграфов
Zakharov P., Shabanov D. A., Успехи математических наук 2023 Т. 78 № 6 (474) С. 183–184
We obtain very accurate estimates for the threshold probability of fractional (4:2)-colorability property in a random k-uniform hypergraph in the binomial model H(n,k,p). ...
Added: November 30, 2023
О концентрации значений j-хроматических чисел случайных гиперграфов
Денисов И. О., Shabanov D. A., Доклады Российской академии наук. Математика, информатика, процессы управления (ранее - Доклады Академии Наук. Математика) 2023 Т. 509 № 1 С. 28–35
The paper deals with the study of the limit distribution of the j-chromatic numbers of a random k-uniform hypergraph in the binomial model H(n,k,p). We consider the sparse case when the expected number of edges is a linear function of the number of vertices n, i.e. is equal to cn for c>0 not depending on n. We ...
Added: October 25, 2023
Estimating the strong r-colorability threshold in random hypergraphs
Alina Khuzieva, Matveeva T., Dmitry Shabanov, Moscow Journal of Combinatorics and Number Theory 2023 Vol. 12 No. 1 P. 57–88
The paper deals with strong r-colorings of a random k-uniform hypergraph in the binomial model H(n,k,p). A vertex coloring is said to be strong for a hypergraph if any two vertices that share a common edge are colored with distinct colors. We consider the sparse case when the expected number of edges is equal to cn and the values r≥k≥3, c>0 remain constant ...
Added: April 10, 2023
  • 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