On the Independence Number of Steiner Systems
From MaRDI portal
Publication:4911171
DOI10.1017/S0963548312000557zbMath1260.05017MaRDI 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
05B05: Combinatorial aspects of block designs
05B20: Combinatorial aspects of matrices (incidence, Hadamard, etc.)
05C65: Hypergraphs
05B25: Combinatorial aspects of finite geometries
05B07: Triple systems
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
05D40: Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.)
Related Items
A note on improved upper bounds on the transversal number of hypergraphs, A note on sum-product estimates over finite valuation rings, On transversal and 2-packing numbers in uniform linear systems, On a problem of Henning and Yeo about the transversal number of uniform linear systems whose 2-packing number is fixed, Independent sets in hypergraphs omitting an intersection, On vertex independence number of uniform hypergraphs, Some combinatorial number theory problems over finite valuation rings, Bounding the independence number in some \((n,k,\ell,\lambda)\)-hypergraphs, Access balancing in storage systems by labeling partial Steiner systems, On transversal numbers of intersecting straight line systems and intersecting segment systems, Block avoiding point sequencings of partial Steiner systems, Large Cross-Free Sets in Steiner Triple Systems
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
