Perfect colorings of submatrix hypergraphs

DOI10.33048/DAIO.2024.31.784MaRDI QIDQ7005950zbMATH OpenFDO

Authors Semëm Olegovich Borodin, Anna A. Taranenko

Publication date 31 March 2025

Published in Diskretnyĭ Analiz i Issledovanie Operatsiĭ (Search for Journal in Brave)

Full work available at URL https://doi.org/10.33048/DAIO.2024.31.784

zbMATH Keywords

hypergraphperfect coloringsymmetric 2-design

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Hypergraphs (05C65)

Cites work

• Combinatorial designs, difference sets, and bent functions as perfect colorings of graphs and multigraphs
• Compact graphs and equitable partitions
• scientific article; zbMATH DE number 4218322 (Why is no real title available?)
• scientific article; zbMATH DE number 2097450 (Why is no real title available?)
• scientific article; zbMATH DE number 864730 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• On circular perfect two-color colorings
• On multiple coverings of the infinite rectangular grid with balls of constant radius
• Perfect colorings of the infinite square grid: coverings and twin colors

This page was built for publication: Perfect colorings of submatrix hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7005950)