OpenAlex
PricingAboutJobs
Log inGet started
Work

Maximum planar sets that determine k distances

HTML

Year: 1996
Type: article
Source: Discrete Mathematics
DOI: 10.1016/0012-365x(95)00153-n
Authors: Paul Erdős, Peter Fishburn
Institutions: HUN-REN Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences, AT&T (United States)
Language: English

Topic: Advanced Combinatorial Mathematics
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Keywords: distance sets, k-distance, planar point sets, triangular lattice, extremal combinatorics

Open Access status: bronze
OpenAlex ID: W2020003328
FWCI: 3.224
Cites: 7
Cited by: 40
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms
Security