scientific article; zbMATH DE number 3368644

zbMath0233.05016MaRDI QIDQ5641161

No author found.

Publication date: 1972

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Other designs, configurations (05B30)

Related Items (32)

Diameter partitioning ⋮ On the expected number of \(k\)-sets ⋮ On the intersection of edges of a geometric graph by straight lines ⋮ On the arrangement of stochastic lines in \(\mathbb{R}^2\) ⋮ Cutting dense point sets in half ⋮ Information Spreading by Mobile Particles on a Line ⋮ On the number of halving planes ⋮ On halving-edges graphs ⋮ On the number of crossing-free partitions ⋮ Long non-crossing configurations in the plane ⋮ Improved bounds for the expected number of \(k\)-sets ⋮ The maximum number of halving lines and the rectilinear crossing number of for ⋮ The maximum multiplicity of a generator in a reduced word ⋮ Intersecting diametral balls induced by a geometric graph ⋮ A generalized converse to a lemma of L. Lovász ⋮ Dense point sets with many halving lines ⋮ On \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\) ⋮ On levels in arrangements of surfaces in three dimensions ⋮ An upper bound on the number of planar \(K\)-sets ⋮ New algorithms and bounds for halving pseudolines ⋮ Matching colored points in the plane: Some new results ⋮ Entering and leaving \(j\)-facets ⋮ A combinatorial version of Sylvester's four-point problem ⋮ Median hyperplanes in normed spaces -- a survey ⋮ Separable partitions ⋮ Some properties of components of bigraphs ⋮ Sums of valences in bigraphs ⋮ On the conjectured upper bounds for entries of mutation count matrices ⋮ Sums of valences in bigraphs. II ⋮ Points surrounding the origin ⋮ The number of small semispaces of a finite set of points in the plane ⋮ Algebraic \(k\)-sets and generally neighborly embeddings

This page was built for publication: