✦ LIBER ✦

An upper bound for the order of primitive permutation groups

✍ Scribed by Il'ya Ponomarenko

Publisher: Springer US
Year: 1997
Tongue: English
Weight: 355 KB
Volume: 85
Category: Article
ISSN: 1573-8795
DOI: 10.1007/bf02355333

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A bound on the rank of primitive solvabl

A bound on the rank of primitive solvable permutation groups

✍ Suzanne M Seager 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 592 KB

A polynomial bound for the orders of pri

A polynomial bound for the orders of primitive solvable groups

✍ P.P Pálfy 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 467 KB

Primitive permutation groups containing

Primitive permutation groups containing an element of order p of small degree, p a prime

✍ Cheryl E Praeger 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 375 KB

An upper bound of Σ 1(ai log ai) for qua

An upper bound of Σ 1(ai log ai) for quasi-primitive sequences

✍ D.A. Clark 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 347 KB

A nonempty sequence A = {ad} of integers a1 < ap < . -a, which are greater than or equal to two, ia called qua&primitive if there do not exist three distinct integers e, aj,ak E A such that (pi, aj 1 = a& We ahow that c l/(~ log G) < 4.2022 for any quasi-primitive sequence.

An upper bound on the “dimension of inte

An upper bound on the “dimension of interval orders”

✍ I Rabinovitch 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 196 KB

An upper bound for orders of certain (k,

An upper bound for orders of certain (k, k))-connected graphs

✍ Kiyoshi Ando 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 275 KB

A fragment of a connected graph G is a subset A of V(C) consisting of components of G-S such that V(G)-S-A #0 where S is a minimum cut of G. A graph G is said to be (k, I;)- We prove the following result. Let k and k be integers with 1 <i < k, and let G be a critically (k, k)-connected graph. If no