scientific article
From MaRDI portal
Publication:3027024
zbMath0625.05012MaRDI QIDQ3027024
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Steiner systems in finite geometry (51E10) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Triple systems (05B07)
Related Items (25)
The independent neighborhoods process ⋮ The minimum independence number for designs ⋮ Multicolor Turán numbers ⋮ On complete arcs in Steiner systems S(2,3,v) and S(2,4,v) ⋮ Complete arcs in Steiner triple systems ⋮ Unnamed Item ⋮ On the maximum double independence number of Steiner triple systems ⋮ Extremal problems in hypergraph colourings ⋮ Large monochromatic components in 3‐edge‐colored Steiner triple systems ⋮ Sparse hypergraphs with low independence number ⋮ Access balancing in storage systems by labeling partial Steiner systems ⋮ On cycle systems with specified weak chromatic number ⋮ Spanning sets and scattering sets in Steiner triple systems ⋮ Partitioning Steiner triple systems into complete arcs ⋮ On the number of points in general position in the plane ⋮ On independent sets in hypergraphs ⋮ On the chromatic number of set systems ⋮ Partitioning twofold triple systems into complete arcs ⋮ On three measures of non-convexity ⋮ Bounding the independence number in some \((n,k,\ell,\lambda)\)-hypergraphs ⋮ On list coloring Steiner triple systems ⋮ Representing graphs in Steiner triple systems ⋮ On the chromatic number of Steiner triple systems of order 25 ⋮ Coloring face-hypergraphs of graphs on surfaces ⋮ Unbalanced Steiner triple systems
This page was built for publication:
