---
res:
  bibo_abstract:
  - "How many points can be placed in an \U0001D45B × \U0001D45B grid sothat every
    (affine) line contains at most \U0001D458 points? Weprove that for \U0001D45B
    ⩾ \U0001D458 ⩾ 1037 the maximum number ofpoints is exactly \U0001D458\U0001D45B.
    Our proof builds on the recent workof Kovács, Nagy and Szabó (who proved an analogousresult
    when \U0001D458 is at least about √\U0001D45B log \U0001D45B), incorporat-ing
    ideas of Jain and Pham. Using the same approach,we also obtain new bounds for
    higher-dimensionalextensions of this problem@eng"
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Aleksandr
      foaf_name: Grebennikov, Aleksandr
      foaf_surname: Grebennikov
      foaf_workInfoHomepage: http://www.librecat.org/personId=776468ec-50b0-11ef-861e-96ad19e894f3
  - foaf_Person:
      foaf_givenName: Matthew Alan
      foaf_name: Kwan, Matthew Alan
      foaf_surname: Kwan
      foaf_workInfoHomepage: http://www.librecat.org/personId=5fca0887-a1db-11eb-95d1-ca9d5e0453b3
    orcid: 0000-0002-4003-7567
  bibo_doi: 10.1112/blms.70510
  bibo_issue: '10'
  bibo_volume: 58
  dct_date: 2026^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/0024-6093
  - http://id.crossref.org/issn/1469-2120
  dct_language: eng
  dct_publisher: Wiley@
  dct_title: No‐(k+1)‐in‐line problem for large constant k@
...