Pages that link to "Item:Q4288888"
From MaRDI portal
The following pages link to Note on independent sets in steiner systems (Q4288888):
Displaying 21 items.
- Bounding the independence number in some \((n,k,\ell,\lambda)\)-hypergraphs (Q1756034) (← links)
- The minimum independence number for designs (Q1894699) (← links)
- Exponents of uniform \(L\)-systems (Q1919666) (← links)
- On explicit constructions of designs (Q2121799) (← links)
- Multicolor Turán numbers (Q2144522) (← links)
- Access balancing in storage systems by labeling partial Steiner systems (Q2205889) (← links)
- Block avoiding point sequencings of partial Steiner systems (Q2673985) (← links)
- On the chromatic number of set systems (Q2748418) (← links)
- (Q3027024) (← links)
- Cliques in Steiner systems (Q3601028) (← links)
- Maximal Independent Subsets in Steiner Systems and in Planar Sets (Q3978702) (← links)
- Codegree Turán Density of Complete $r$-Uniform Hypergraphs (Q4563373) (← links)
- On uncrowded hypergraphs (Q4697811) (← links)
- On the Independence Number of Steiner Systems (Q4911171) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)
- On independent sets in hypergraphs (Q5409863) (← links)
- The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 (Q5889065) (← links)
- Independent sets in hypergraphs omitting an intersection (Q6052482) (← links)
- Independence number of hypergraphs under degree conditions (Q6076735) (← links)
- Coloring unions of nearly disjoint hypergraph cliques (Q6144279) (← links)
- On the maximum double independence number of Steiner triple systems (Q6146768) (← links)
