Determination of the size of defining set for Steiner triple systems
Nazli Besharati, and M. Mortezaeefar

TL;DR
This paper investigates the size of defining sets for 3-colorings of Steiner triple systems, determining exact values for small systems and establishing bounds for larger ones.
Contribution
It provides the first comprehensive analysis of defining sets in Steiner triple systems, including exact sizes for systems up to order 15 and bounds for larger systems.
Findings
Determined minimum defining sets for all non-isomorphic STS(v) with v ≤ 15.
Calculated the defining number for all Steiner triple systems of order v.
Established lower bounds for the size of the largest minimal defining set for all STS(v).
Abstract
Every Steiner triple system is a uniform hypergraph. The coloring of hypergraph and its special case Steiner triple systems, {STS}, is studied extensively. But the defining set of the coloring of hypergraph even its special case {STS}, is not explored yet. We study minimum defining set and the largest minimal defining set for -coloring of {STS}. We determined minimum defining set and the largest minimal defining set, for all non-isomorphic {STS}, . Also we have found the {\sf defining number} for all Steiner triple systems of order , and some lower bounds for the size of the largest minimal defining set for all Steiner triple systems of order , for each admissible .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems
