Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Orchard-planting_problem> ?p ?o. }
Showing items 1 to 33 of
33
with 100 items per page.
- Orchard-planting_problem abstract "In discrete geometry, the original orchard-planting problem asks for the maximum number of 3-point lines attainable by a configuration of points in the plane. It is also called the tree-planting problem or simply the orchard problem. There are also investigations into how many k-point lines there can be. Hallard T. Croft and Paul Erdős proved tk > c n2 / k3, 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.".
- Orchard-planting_problem thumbnail Orchard-planting_problem.svg?width=300.
- Orchard-planting_problem wikiPageID "29600081".
- Orchard-planting_problem wikiPageRevisionID "567397035".
- Orchard-planting_problem author1Link "Stefan Burr".
- Orchard-planting_problem author2Link "Branko Grünbaum".
- Orchard-planting_problem author3Link "Neil Sloane".
- Orchard-planting_problem hasPhotoCollection Orchard-planting_problem.
- Orchard-planting_problem last "Burr".
- Orchard-planting_problem last "Grünbaum".
- Orchard-planting_problem last "Sloane".
- Orchard-planting_problem title "Orchard-Planting Problem".
- Orchard-planting_problem urlname "Orchard-PlantingProblem".
- Orchard-planting_problem year "1974".
- Orchard-planting_problem subject Category:Discrete_geometry.
- Orchard-planting_problem subject Category:Euclidean_plane_geometry.
- Orchard-planting_problem subject Category:Mathematical_problems.
- Orchard-planting_problem type Abstraction100002137.
- Orchard-planting_problem type Attribute100024264.
- Orchard-planting_problem type Condition113920835.
- Orchard-planting_problem type Difficulty114408086.
- Orchard-planting_problem type MathematicalProblems.
- Orchard-planting_problem type Problem114410605.
- Orchard-planting_problem type State100024720.
- Orchard-planting_problem comment "In discrete geometry, the original orchard-planting problem asks for the maximum number of 3-point lines attainable by a configuration of points in the plane. It is also called the tree-planting problem or simply the orchard problem. There are also investigations into how many k-point lines there can be. Hallard T. Croft and Paul Erdős proved tk > c n2 / k3, 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.".
- Orchard-planting_problem label "Orchard-planting problem".
- Orchard-planting_problem sameAs m.0fpj87m.
- Orchard-planting_problem sameAs Q7100169.
- Orchard-planting_problem sameAs Q7100169.
- Orchard-planting_problem sameAs Orchard-planting_problem.
- Orchard-planting_problem wasDerivedFrom Orchard-planting_problem?oldid=567397035.
- Orchard-planting_problem depiction Orchard-planting_problem.svg.
- Orchard-planting_problem isPrimaryTopicOf Orchard-planting_problem.
