The Lines and Planes Connecting the Points of a Finite Set

From MaRDI portal
Revision as of 05:24, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5805405

DOI10.2307/1990609zbMath0043.14603OpenAlexW4252300791WikidataQ55954539 ScholiaQ55954539MaRDI QIDQ5805405

Theodore S. Motzkin

Publication date: 1951

Full work available at URL: https://doi.org/10.2307/1990609




Related Items (57)

A resolution of the Sylvester-Gallai problem of J.-P. SerreA survey of Sylvester's problem and its generalizationsA Sylvester theorem for conic sectionsOn sets defining few ordinary linesLines, circles, planes and spheresA generalisation of Sylvester's problem to higher dimensionsGeometria combinatoria e geometrie finiteA Sylvester-Gallai result for concurrent lines in the complex planeSome combinatorial problems in the planeOn the number of ordinary lines determined by sets in complex spaceUnnamed ItemSupersolvable simplicial arrangementsThe work of June HuhThe ordinary line problem revisitedCombinatorics and Hodge theoryCombinatorial geometry takes the leadOn sets defining few ordinary circlesOn the number of ordinary circles determined by \(n\) pointsA proof of a consequence of Dirac's conjectureOn the combinatorial problems which I would most like to see solvedA bichromatic incidence bound and an applicationResearch problemsA sharpening of Fisher's inequalityMatroid enumeration for incidence geometryOn ZonotopesOn a generalization of the Gallai-Sylvester theoremA fractional version of the Erdős-Faber-Lovász conjectureOn the affine Sylvester problemEmbedding a Latin square with transversal into a projective spaceIntersection properties of polyhedral normsThere exist \(6n/13\) ordinary pointsSets for which no point lies on many connecting linesA lower bound on the number of cells in arrangements of hyperplanesOn the minimum number of ordinary conicsOn sets defining few ordinary planesThe Sylvester-Gallai theorem, colourings and algebraA Gallai-type problemOn sets defining few ordinary hyperplanesRight \(l\)-groups, geometric Garside groups, and solutions of the quantum Yang-Baxter equationThe combinatorics of N. G. de BruijnOrdinary planes, coplanar quadruples, and space quarticsAn extension of a theorem of the Bruijn and Erdős on combinatorial designsOn the Number of Ordinary ConicsOn finite sets of points in \(P^ 3\)On the number of ordinary planesÜber die Projektionenkörper konvexer PolytopeMultiply intersecting families of setsA Generalization of the Theorem of SylvesterOn ordinary planesPersonal reminiscences and remarks on the mathematical work of Tibor GallaiAffine embeddings of Sylvester-Gallai designsThe Desmic conjectureOn the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometryTwo Chromatic Conjectures: One for Vertices and One for EdgesOn number of circles intersected by a lineOn the number of circles determined by \(n\) points in the Euclidean planeBeitrag zur kombinatorischen Inzidenzgeometrie






This page was built for publication: The Lines and Planes Connecting the Points of a Finite Set