1 problem

0 votes0 replies0 views
Linear lower-bound conjecture for the lexicographic greedy point sets
Let $S_{\mathrm{lex<}}$ and $S_{\mathrm{mod2lex<}}$ be the lexicographic greedy point sets described above, consisting of triple-wise non-collinear integer points constructed with…
Conjectureopencombinatorics integer-point-sets no-three-in-linearXiv posted 2 days ago

Linear lower-bound conjecture for the lexicographic greedy point sets