Large non-trivial $t$-intersecting families for signed sets
Tian Yao, Benjian Lv, Kaishun Wang

TL;DR
This paper characterizes the structure and maximum size of large non-trivial t-intersecting families of signed sets, extending known results to more complex set families.
Contribution
It provides a complete description of large maximal non-trivial t-intersecting families of signed sets, generalizing Hilton-Milner results.
Findings
Identifies the structure of large maximal non-trivial t-intersecting families
Determines maximum size of such families for t ≥ 2
Extends Hilton-Milner-type results to signed sets
Abstract
For positive integers with and , a set is called a -signed -set on if are distinct elements of and . We say a -intersecting family consisting of -signed -sets on is trivial if each member of this family contains a fixed -signed -set. In this paper, we determine the structure of large maximal non-trivial -intersecting families. In particular, we characterize the non-trivial -intersecting families with maximum size for , extending a Hilton-Milner-type result for signed sets given by Borg.
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
TopicsLimits and Structures in Graph Theory · graph theory and CDMA systems · Graph theory and applications
