scientific article; zbMATH DE number 3368644

From MaRDI portal
Publication:5641161

zbMath0233.05016MaRDI QIDQ5641161

László Lovász

Publication date: 1972


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



Related Items

Diameter partitioningOn the expected number of \(k\)-setsOn the intersection of edges of a geometric graph by straight linesOn the arrangement of stochastic lines in \(\mathbb{R}^2\)Cutting dense point sets in halfInformation Spreading by Mobile Particles on a LineOn the number of halving planesOn halving-edges graphsOn the number of crossing-free partitionsLong non-crossing configurations in the planeImproved bounds for the expected number of \(k\)-setsThe maximum number of halving lines and the rectilinear crossing number of forThe maximum multiplicity of a generator in a reduced wordIntersecting diametral balls induced by a geometric graphA generalized converse to a lemma of L. LovászDense point sets with many halving linesOn \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\)On levels in arrangements of surfaces in three dimensionsAn upper bound on the number of planar \(K\)-setsNew algorithms and bounds for halving pseudolinesMatching colored points in the plane: Some new resultsEntering and leaving \(j\)-facetsA combinatorial version of Sylvester's four-point problemMedian hyperplanes in normed spaces -- a surveySeparable partitionsSome properties of components of bigraphsSums of valences in bigraphsOn the conjectured upper bounds for entries of mutation count matricesSums of valences in bigraphs. IIPoints surrounding the originThe number of small semispaces of a finite set of points in the planeAlgebraic \(k\)-sets and generally neighborly embeddings