Cross-intersecting families and primitivity of symmetric systems
Jun Wang, Huajun Zhang

TL;DR
This paper generalizes Hilton's theorem on cross-intersecting families by introducing symmetric systems and analyzing the size bounds of cross-$rak p$-families, with applications to various combinatorial structures.
Contribution
It introduces the concept of symmetric systems and establishes size bounds for cross-$rak p$-families, extending classical results to broader combinatorial contexts.
Findings
Established bounds on the sum of sizes of cross-$rak p$-families.
Generalized Hilton's theorem to symmetric systems.
Characterized optimal families using primitivity of symmetric systems.
Abstract
Let be a finite set and , the power set of , satisfying three conditions: (a) is an ideal in , that is, if and , then ; (b) For with , if for any with ; (c) for every . The pair is called a symmetric system if there is a group transitively acting on and preserving the ideal . A family is said to be a cross--family of if for any and with . We prove that if is a symmetric system and is a cross--family of , then \[\sum_{i=1}^m|{A}_i|\leq\left\{…
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 applications · Finite Group Theory Research
