A proof of Erdős-Fishburn's conjecture for \(g(6)=13\)
The electronic journal of combinatorics, Tome 19 (2012) no. 4
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

A planar point set $X$ in the Euclidean plane is called a $k$-distance set if there are exactly $k$ distances between two distinct points in $X$. An interesting problem is to find the largest possible cardinality of a $k$-distance set. This problem was introduced by Erdős and Fishburn (1996). Maximum planar sets that determine $k$ distances for $k$ less than 5 have been identified. The 6-distance conjecture of Erdős and Fishburn states that 13 is the maximum number of points in the plane that determine exactly 6 different distances. In this paper, we prove the conjecture.
DOI : 10.37236/2917
Classification : 52C10
Mots-clés : 6-distance conjecture, diameter graph, independent set

Wei Xianglin  1

1 Hebei University of Science and Technology
@article{10_37236_2917,
     author = {Wei Xianglin},
     title = {A proof of {Erd\H{o}s-Fishburn's} conjecture for \(g(6)=13\)},
     journal = {The electronic journal of combinatorics},
     year = {2012},
     volume = {19},
     number = {4},
     doi = {10.37236/2917},
     zbl = {1270.52022},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/2917/}
}
TY  - JOUR
AU  - Wei Xianglin
TI  - A proof of Erdős-Fishburn's conjecture for \(g(6)=13\)
JO  - The electronic journal of combinatorics
PY  - 2012
VL  - 19
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.37236/2917/
DO  - 10.37236/2917
ID  - 10_37236_2917
ER  - 
%0 Journal Article
%A Wei Xianglin
%T A proof of Erdős-Fishburn's conjecture for \(g(6)=13\)
%J The electronic journal of combinatorics
%D 2012
%V 19
%N 4
%U http://geodesic.mathdoc.fr/articles/10.37236/2917/
%R 10.37236/2917
%F 10_37236_2917
Wei Xianglin. A proof of Erdős-Fishburn's conjecture for \(g(6)=13\). The electronic journal of combinatorics, Tome 19 (2012) no. 4. doi: 10.37236/2917

Cité par Sources :