English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We investigate the question of finding a bound for the size of a$\chi$-colorable finite visibility graph that has at most $\ell$ collinearpoints. This can be regarded as a relaxed version of the Big Line - Big Cliqueconjecture. We prove that any finite point set that has at least 2311 pointshas either 4 collinear points or a visibility graph that cannot be 5-colored.

5 Colorable Visibility Graphs Have Bounded Size or 4 Collinear Points