An Erdös-Ko-Rado theorem for regular intersecting families of octads
Publication
, Journal Article
Brouwer, AE; Calderbank, AR
Published in: Graphs and Combinatorics
December 1, 1986
Codewords of weight 8 in the [24, 12] binary Golay code are called octads. A family ℱ of octads is said to be a regular intersecting family if ℱ is a 1-design and |x ∩ y| ≠ 0 for all x, y ∈ ℱ. We prove that if ℱ is a regular intersecting family of octads then |ℱ| ≤ 69. Equality holds if and only if ℱ is a quasi-symmetric 2-(24, 8, 7) design. We then apply techniques from coding theory to prove nonexistence of this extremal configuration. © 1986 Springer-Verlag.
Duke Scholars
Published In
Graphs and Combinatorics
DOI
EISSN
1435-5914
ISSN
0911-0119
Publication Date
December 1, 1986
Volume
2
Issue
1
Start / End Page
309 / 316
Related Subject Headings
- Computation Theory & Mathematics
- 0802 Computation Theory and Mathematics
- 0101 Pure Mathematics
Citation
APA
Chicago
ICMJE
MLA
NLM
Brouwer, A. E., & Calderbank, A. R. (1986). An Erdös-Ko-Rado theorem for regular intersecting families of octads. Graphs and Combinatorics, 2(1), 309–316. https://doi.org/10.1007/BF01788105
Brouwer, A. E., and A. R. Calderbank. “An Erdös-Ko-Rado theorem for regular intersecting families of octads.” Graphs and Combinatorics 2, no. 1 (December 1, 1986): 309–16. https://doi.org/10.1007/BF01788105.
Brouwer AE, Calderbank AR. An Erdös-Ko-Rado theorem for regular intersecting families of octads. Graphs and Combinatorics. 1986 Dec 1;2(1):309–16.
Brouwer, A. E., and A. R. Calderbank. “An Erdös-Ko-Rado theorem for regular intersecting families of octads.” Graphs and Combinatorics, vol. 2, no. 1, Dec. 1986, pp. 309–16. Scopus, doi:10.1007/BF01788105.
Brouwer AE, Calderbank AR. An Erdös-Ko-Rado theorem for regular intersecting families of octads. Graphs and Combinatorics. 1986 Dec 1;2(1):309–316.
Published In
Graphs and Combinatorics
DOI
EISSN
1435-5914
ISSN
0911-0119
Publication Date
December 1, 1986
Volume
2
Issue
1
Start / End Page
309 / 316
Related Subject Headings
- Computation Theory & Mathematics
- 0802 Computation Theory and Mathematics
- 0101 Pure Mathematics