Sciact
  • EN
  • RU

Perfect Colorings of Submatrix Hypergraphs Full article

Journal Journal of Applied and Industrial Mathematics
ISSN: 1990-4789 , E-ISSN: 1990-4797
Output data Year: 2024, Volume: 18, Number: 3, Pages: 424–440 Pages count : 16 DOI: 10.1134/S1990478924030050
Tags hypergraph, symmetric 2-design, perfect coloring
Authors Borodin S.O. 1 , Taranenko A.A. 1
Affiliations
1 Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, Novosibirsk, 630090 Russia

Funding (1)

1 Russian Science Foundation 22-11-00266

Abstract: A submatrix hypergraph is a hypergraph whose vertices are entries of an matrix and hyperedges are submatrices of order. In this paper, we consider perfect colorings of submatrix hypergraphs andstudy their parameters. We provide several constructions of perfect colorings of and prove that the incidence matrices of-designs are perfect colorings of the submatrix hypergraph. Moreover, wedescribe all perfect 2-colorings of hypergraphs and.
Cite: Borodin S.O. , Taranenko A.A.
Perfect Colorings of Submatrix Hypergraphs
Journal of Applied and Industrial Mathematics. 2024. V.18. N3. P.424–440. DOI: 10.1134/S1990478924030050 Scopus РИНЦ OpenAlex
Original: Бородин С.О. , Тараненко А.А.
Совершенные раскраски гиперграфа подматриц
Дискретный анализ и исследование операций. 2024. Т.31. №3. С.54–78. DOI: 10.33048/daio.2024.31.784 РИНЦ OpenAlex
Dates:
Submitted: Sep 4, 2023
Accepted: Mar 22, 2024
Published print: Dec 1, 2024
Published online: Dec 1, 2024
Identifiers:
Scopus: 2-s2.0-85211236636
Elibrary: 75143765
OpenAlex: W4404901193
Citing: Пока нет цитирований
Altmetrics: