✦ LIBER ✦

On the maximal size of independent generating sets of PSL2(q)

✍ Scribed by Julius Whiston; Jan Saxl

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 84 KB
Volume: 258
Category: Article
ISSN: 0021-8693
DOI: 10.1016/s0021-8693(02)00648-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maximal Independent Generating Sets of t

Maximal Independent Generating Sets of the Symmetric Group

✍ Julius Whiston 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 105 KB

On the genus of the groups PSL(2, q), PS

On the genus of the groups PSL(2, q), PSL(3, q), and PSp(4, q)

✍ Clifton E. Ealy Jr 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 569 KB

Large sets of 3-designs from psl(2, q),

Large sets of 3-designs from psl(2, q), with block sizes 4 and 5

✍ C. A. Cusack; S. W. Graham; D. L. Kreher 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 568 KB

## Abstract We determine the distribution of 3−(__q__ + 1,__k__,λ) designs, with __k__ ϵ {4,5}, among the orbits of __k__‐element subsets under the action of PSL(2,__q__), for __q__ ϵ 3 (mod 4), on the projective line. As a consequence, we give necessary and sufficient conditions for the existence

On minimum maximal independent sets of a

On minimum maximal independent sets of a graph

✍ Julie Haviland 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 638 KB

Constraints on the number of maximal ind

Constraints on the number of maximal independent sets in graphs

✍ Jiuqiang Liu 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 387 KB 👁 2 views

## Abstract A maximal independent set of a graph __G__ is an independent set that is not contained properly in any other independent set of __G__. Let __i(G)__ denote the number of maximal independent sets of __G__. Here, we prove two conjectures, suggested by P. Erdös, that the maximum number of m

Independent sets of maximal size in tens

Independent sets of maximal size in tensor powers of vertex-transitive graphs

✍ Cheng Yeaw Ku; Benjamin B. McMillan 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 97 KB 👁 2 views

## Abstract Let __G__ be a connected, nonbipartite vertex‐transitive graph. We prove that if the only independent sets of maximal cardinality in the tensor product __G__ × __G__ are the preimages of the independent sets of maximal cardinality in __G__ under projections, then the same holds for all