On maximum intersecting sets in direct and wreath product of groups
Ademir Hujdurovi\'c, Klavdija Kutnar, Dragan Maru\v{s}i\v{c} and, \v{S}tefko Miklavi\v{c}

TL;DR
This paper investigates maximum intersecting sets in permutation groups, proves a conjecture about derangement graphs being complete multipartite, and explores properties of group products, correcting previous literature errors.
Contribution
It proves a conjecture on derangement graphs being complete multipartite and studies intersecting sets in direct and wreath product groups, including EKR-properties.
Findings
Proved the conjecture on derangement graphs being complete multipartite.
Analyzed maximum intersecting sets in direct and wreath product groups.
Corrected errors in existing literature on intersecting sets and EKR-properties.
Abstract
For a permutation group acting on a set , a subset of is said to be an intersecting set if for every pair of elements there exists such that . The intersection density of a transitive permutation group is the maximum value of the quotient where is a stabilizer of a point and runs over all intersecting sets in . If is the largest intersecting set in then is said to have the Erd\H{o}s-Ko-Rado (EKR)-property, and moreover, has the strict-EKR-property if every intersecting set of maximum size in is a coset of a point stabilizer. Intersecting sets in coincide with independent sets in the so-called derangement graph , defined as the Cayley graph on with connection set consisting of all derangements, that is, fixed-point free elements of . In this paper a…
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
TopicsFinite Group Theory Research · graph theory and CDMA systems · Advanced Graph Theory Research
