Advanced search
1 file | 250.23 KB Add to list

The largest Erdős-Ko-Rado sets in 2-(v,k,1) designs

(2015) DESIGNS CODES AND CRYPTOGRAPHY. 75(3). p.465-481
Author
Organization
Abstract
An ErdAs-Ko-Rado set in a block design is a set of pairwise intersecting blocks. In this article we study ErdAs-Ko-Rado sets in designs, Steiner systems. The Steiner triple systems and other special classes are treated separately. For , we prove that the largest ErdAs-Ko-Rado sets cannot be larger than a point-pencil if and that the largest ErdAs-Ko-Rado sets are point-pencils if also and . For unitals we also determine an upper bound on the size of the second-largest maximal ErdAs-Ko-Rado sets.
Keywords
Block design, Erdos–Ko–Rado set, Steiner system, Unital, THEOREMS, SPACES

Downloads

  • (...).pdf
    • full text
    • |
    • UGent only
    • |
    • PDF
    • |
    • 250.23 KB

Citation

Please use this url to cite or link to this publication:

MLA
De Boeck, Maarten. “The Largest Erdős-Ko-Rado Sets in 2-(v,k,1) Designs.” DESIGNS CODES AND CRYPTOGRAPHY 75.3 (2015): 465–481. Print.
APA
De Boeck, M. (2015). The largest Erdős-Ko-Rado sets in 2-(v,k,1) designs. DESIGNS CODES AND CRYPTOGRAPHY, 75(3), 465–481.
Chicago author-date
De Boeck, Maarten. 2015. “The Largest Erdős-Ko-Rado Sets in 2-(v,k,1) Designs.” Designs Codes and Cryptography 75 (3): 465–481.
Chicago author-date (all authors)
De Boeck, Maarten. 2015. “The Largest Erdős-Ko-Rado Sets in 2-(v,k,1) Designs.” Designs Codes and Cryptography 75 (3): 465–481.
Vancouver
1.
De Boeck M. The largest Erdős-Ko-Rado sets in 2-(v,k,1) designs. DESIGNS CODES AND CRYPTOGRAPHY. 2015;75(3):465–81.
IEEE
[1]
M. De Boeck, “The largest Erdős-Ko-Rado sets in 2-(v,k,1) designs,” DESIGNS CODES AND CRYPTOGRAPHY, vol. 75, no. 3, pp. 465–481, 2015.
@article{5942408,
  abstract     = {An ErdAs-Ko-Rado set in a block design is a set of pairwise intersecting blocks. In this article we study ErdAs-Ko-Rado sets in designs, Steiner systems. The Steiner triple systems and other special classes are treated separately. For , we prove that the largest ErdAs-Ko-Rado sets cannot be larger than a point-pencil if and that the largest ErdAs-Ko-Rado sets are point-pencils if also and . For unitals we also determine an upper bound on the size of the second-largest maximal ErdAs-Ko-Rado sets.},
  author       = {De Boeck, Maarten},
  issn         = {0925-1022},
  journal      = {DESIGNS CODES AND CRYPTOGRAPHY},
  keywords     = {Block design,Erdos–Ko–Rado set,Steiner system,Unital,THEOREMS,SPACES},
  language     = {eng},
  number       = {3},
  pages        = {465--481},
  title        = {The largest Erdős-Ko-Rado sets in 2-(v,k,1) designs},
  url          = {http://dx.doi.org/10.1007/s10623-014-9929-5},
  volume       = {75},
  year         = {2015},
}

Altmetric
View in Altmetric
Web of Science
Times cited: