The minimum independence number for designs
From MaRDI portal
Publication:1894699
DOI10.1007/BF01200754zbMath0824.05005OpenAlexW2027121235MaRDI QIDQ1894699
David A. Grable, Vojtěch Rödl, Kevin T. Phelps
Publication date: 24 July 1995
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01200754
Related Items (10)
Multicolor Turán numbers ⋮ Complete arcs in Steiner triple systems ⋮ Unnamed Item ⋮ Extremal problems in hypergraph colourings ⋮ Large monochromatic components in 3‐edge‐colored Steiner triple systems ⋮ Access balancing in storage systems by labeling partial Steiner systems ⋮ On the chromatic number of set systems ⋮ Cliques in Steiner systems ⋮ On proper colourings of hypergraphs using prescribed colours ⋮ \(F\)-factors in hypergraphs via absorption
Cites Work
- The number of submatrices of a given type in a Hadamard matrix and related results
- A Ramsey type problem concerning vertex colourings
- Maximal Independent Subsets in Steiner Systems and in Planar Sets
- A Canonical Ramsey Theorem
- Note on independent sets in steiner systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The minimum independence number for designs
