Maximum planar sets that determine \(k\) distances (Q1126289): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q94701091, #quickstatements; #temporary_batch_1706897434465
Created claim: DBLP publication ID (P1635): journals/dm/ErdosF96, #quickstatements; #temporary_batch_1731483406851
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Q1104213 / rank
Normal rank
 
Property / author
 
Property / author: Peter C. Fishburn / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On A Problem of P. Erdos / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of different distances determined by a set of points in the Euclidean plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sets of Distances of n Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex nonagons with five intervertex distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex polygons with few intervertex distances / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/dm/ErdosF96 / rank
 
Normal rank

Latest revision as of 08:50, 13 November 2024

scientific article
Language Label Description Also known as
English
Maximum planar sets that determine \(k\) distances
scientific article

    Statements

    Maximum planar sets that determine \(k\) distances (English)
    0 references
    0 references
    0 references
    21 August 1997
    0 references
    The authors identify subsets of points in the plane with the property that there are \(k\) interpoint distances and have as many points as possible. They do this for \(k\leq 5\). They conjecture that such maximal point set for \(k\geq 7\) must be subsets of the triangular lattice.
    0 references
    extremal sets of points
    0 references
    point configurations
    0 references
    extremal problems
    0 references
    distances in graph
    0 references

    Identifiers