Happy Ending or Many Concurrent Lines
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866912125867261952 |
|---|---|
| author | Furukawa, Koki |
| author_facet | Furukawa, Koki |
| contents | For each $n \geq 2$, $l \geq 3$, let ${ES}_L (l,n)$ be the minimum $N$ such that every family of $N$-lines in the plane contains either $l$ concurrent lines or $n$ lines in convex position. In this papar, we give the upper and lower bounds for $ES_L (l,n)$. This is one of the extensions of the line version of Erdös-Szekeres convex polygon problem. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_03122 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Happy Ending or Many Concurrent Lines Furukawa, Koki Combinatorics For each $n \geq 2$, $l \geq 3$, let ${ES}_L (l,n)$ be the minimum $N$ such that every family of $N$-lines in the plane contains either $l$ concurrent lines or $n$ lines in convex position. In this papar, we give the upper and lower bounds for $ES_L (l,n)$. This is one of the extensions of the line version of Erdös-Szekeres convex polygon problem. |
| title | Happy Ending or Many Concurrent Lines |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2409.03122 |