✦ LIBER ✦

41 is the Largest Size of a Cap in PG(4,4)

✍ Scribed by Yves Edel; Jürgen Bierbrauer

Book ID: 110263482
Publisher: Springer
Year: 1999
Tongue: English
Weight: 63 KB
Volume: 16
Category: Article
ISSN: 0925-1022
DOI: 10.1023/a:1008389013117

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Size of a Cap in PG(n,q) with q E

On the Size of a Cap in PG(n,q) with q Even and n ≥ 3

✍ Jin-Ming Chao 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 42 KB

On the Largest Cap in a Convex Subset of

On the Largest Cap in a Convex Subset of a Sphere

✍ White, D. J. 📂 Article 📅 1967 🏛 Oxford University Press 🌐 English ⚖ 133 KB

The lines of PG(4, 2) are the points on

The lines of PG(4, 2) are the points on a quintic in PG(9,2)

✍ Ron Shaw; Neil A Gordon 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 226 KB

On Uniformly Packed [n, n-k, 4] Codes ov

On Uniformly Packed [n, n-k, 4] Codes over GF(q) and a Class of Caps in PG(k-1, q)

✍ Calderbank, R. 📂 Article 📅 1982 🏛 Oxford University Press 🌐 English ⚖ 364 KB

Size of the Largest Antichain in a Parti

Size of the Largest Antichain in a Partition Poset

✍ V. M. Blinovsky; L. H. Harper 📂 Article 📅 2002 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 122 KB

The size of the largest hole in a random

The size of the largest hole in a random graph

✍ Tomasz Łuczak 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 775 KB

Let H(n, p) denote the size of the largest induced cycle in a random graph C(n, p). It is shown that if the expected average degree of G(n, p) is a constant larger than 1, then H(n, p) is of the order n with probability 1 -o(l). Moreover, for C(n, p) with large average degree, H(n, p) is determined