On the Independence Number of Steiner Systems
DOI10.1017/S0963548312000557zbMath1260.05017OpenAlexW2098133175MaRDI QIDQ4911171
Jacques Verstraete, Alex K. Eustis
Publication date: 14 March 2013
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548312000557
Combinatorial aspects of block designs (05B05) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Hypergraphs (05C65) Combinatorial aspects of finite geometries (05B25) Triple systems (05B07) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items (13)
Cites Work
- Unnamed Item
- Unnamed Item
- A note on the independence number of triangle-free graphs
- On a packing and covering problem
- Extremal uncrowded hypergraphs
- An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
- A Lower Bound for Heilbronn'S Problem
- Improved lower bounds on k‐independence
- Maximal Independent Subsets in Steiner Systems and in Planar Sets
- Note on independent sets in steiner systems
- On uncrowded hypergraphs
This page was built for publication: On the Independence Number of Steiner Systems