Determination of the size of defining set for Steiner triple systems

DOI10.1080/09720529.2020.1796334zbMath1502.05175arXiv1807.08277OpenAlexW3136603716MaRDI QIDQ5059557

M. Mortezaeefar, Nazli Besharati

Publication date: 23 December 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1807.08277

zbMATH Keywords

hypergraphdefining setcoloringSteiner triple systems

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On defining numbers of vertex colouring of regular graphs
• Defining sets in vertex colorings of graphs and latin rectangles
• On colourings of Steiner triple systems
• Uniquely 3-colourable Steiner triple systems
• The forcing Steiner number of a graph
• Defining sets in (proper) vertex colorings of the Cartesian product of a cycle with a complete graph

This page was built for publication: Determination of the size of defining set for Steiner triple systems