Partial covering arrays and a generalized Erdös-Ko-Rado property

@inproceedings{Carey2005PartialCA,
  title={Partial covering arrays and a generalized Erd{\"o}s-Ko-Rado property},
  author={Patricia A. Carey and Anant P. Godbole},
  year={2005}
}
  • Patricia A. Carey, Anant P. Godbole
  • Published 2005
  • Mathematics
  • The classical Erdýos-Ko-Rado theorem states that if k ≤ ⌊n/2⌋ then the largest family of pairwise intersecting k-subsets of [n] = {0,1, . . . , n} is of size n 1 k 1 

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Citations

    Publications citing this paper.
    SHOWING 1-4 OF 4 CITATIONS

    $t$-Covering Arrays Generated by a Tiling Probability Model

    VIEW 2 EXCERPTS
    CITES BACKGROUND & METHODS

    CTH02-4: When Does One Redundant Parity-Check Equation Matter?

    VIEW 1 EXCERPT
    CITES METHODS

    Stopping and Trapping Sets in Generalized Covering Arrays

    VIEW 2 EXCERPTS
    CITES BACKGROUND