Abstract
Let be the symmetric group of degree . Let be the maximal size of a subset of such that whenever and and let be the minimal size of a family of proper subgroups of whose union is . We prove that both functions and are asymptotically equal to when is even. This, together with a result of S. Blackburn, implies that tends to as . Moreover, we give a lower bound of on which is independent of the classification of finite simple groups. We also calculate, for large enough , the clique number of the graph defined as follows: the vertices are the elements of and two vertices are connected by an edge if .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.