Pages that link to "Item:Q1894699"
From MaRDI portal
The following pages link to The minimum independence number for designs (Q1894699):
Displaying 15 items.
- Linear dependencies among subsets of a finite set (Q788726) (← links)
- Complete arcs in Steiner triple systems (Q1374194) (← links)
- On minimum index Stanton 4-cycle designs (Q2089529) (← links)
- Multicolor Turán numbers (Q2144522) (← links)
- Access balancing in storage systems by labeling partial Steiner systems (Q2205889) (← links)
- \(F\)-factors in hypergraphs via absorption (Q2345534) (← links)
- On the size of partial block designs with large blocks (Q2581419) (← links)
- Designs associated with maximum independent sets of a graph (Q2638418) (← links)
- On the chromatic number of set systems (Q2748418) (← links)
- Generating sets in Steiner triple systems (Q2777505) (← links)
- On proper colourings of hypergraphs using prescribed colours (Q3057818) (← links)
- Cliques in Steiner systems (Q3601028) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)
- Large monochromatic components in 3‐edge‐colored Steiner triple systems (Q6187431) (← links)
- Some results and problems on clique coverings of hypergraphs (Q6606330) (← links)