The following pages link to (Q3027024):
Displayed 25 items.
- The independent neighborhoods process (Q312273) (← links)
- On three measures of non-convexity (Q522338) (← links)
- Representing graphs in Steiner triple systems (Q742566) (← links)
- Spanning sets and scattering sets in Steiner triple systems (Q1176376) (← links)
- Partitioning Steiner triple systems into complete arcs (Q1176742) (← links)
- Partitioning twofold triple systems into complete arcs (Q1198511) (← links)
- Unbalanced Steiner triple systems (Q1323826) (← links)
- Complete arcs in Steiner triple systems (Q1374194) (← links)
- Sparse hypergraphs with low independence number (Q1705800) (← links)
- Bounding the independence number in some \((n,k,\ell,\lambda)\)-hypergraphs (Q1756034) (← links)
- Coloring face-hypergraphs of graphs on surfaces (Q1850616) (← links)
- The minimum independence number for designs (Q1894699) (← links)
- On cycle systems with specified weak chromatic number (Q1957974) (← links)
- Multicolor Turán numbers (Q2144522) (← links)
- Access balancing in storage systems by labeling partial Steiner systems (Q2205889) (← links)
- On the chromatic number of Steiner triple systems of order 25 (Q2568479) (← links)
- On complete arcs in Steiner systems S(2,3,v) and S(2,4,v) (Q2641309) (← links)
- On the chromatic number of set systems (Q2748418) (← links)
- (Q2777505) (← links)
- On list coloring Steiner triple systems (Q3578155) (← links)
- On the number of points in general position in the plane (Q4645041) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)
- On independent sets in hypergraphs (Q5409863) (← links)
- On the maximum double independence number of Steiner triple systems (Q6146768) (← links)
- Large monochromatic components in 3‐edge‐colored Steiner triple systems (Q6187431) (← links)