Orchard-planting problem
id:
orchard-planting-problem-186-13275864
title:
Orchard-planting problem
text:
In discrete geometry, the original orchard-planting problem asks for the maximum number of 3-point lines attainable by a configuration of a specific number of points in the plane. There are also investigations into how many k-point lines there can be. Hallard T. Croft and Paul Erdős proved t k > c n 2 k 3, where n is the number of points and tk is the number of k-point lines. Their construction contains some m-point lines, where m > k. One can also ask the question if these are not allowed.
brand slug:
wiki
category slug:
encyclopedia
description:
Geometry; how many 3-point lines can n points form
original url:
https://en.wikipedia.org/wiki/Orchard-planting_problem
date created:
2010-11-15T01:29:04Z
date modified:
2024-09-08T02:54:57Z
main entity:
{"identifier":"Q7100169","url":"https://www.wikidata.org/entity/Q7100169"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/8/88/Orchard-planting_problem.svg","width":234,"height":217}
fields total:
13
integrity:
16