Report
Coloring problems on arrangements of pseudolines
| العنوان: | Coloring problems on arrangements of pseudolines |
|---|---|
| المؤلفون: | Roch, Sandro |
| سنة النشر: | 2024 |
| المجموعة: | Computer Science Mathematics |
| مصطلحات موضوعية: | Mathematics - Combinatorics, Computer Science - Computational Geometry, Computer Science - Discrete Mathematics |
| الوصف: | Arrangements of pseudolines are a widely studied generalization of line arrangements. They are defined as a finite family of infinite curves in the Euclidean plane, any two of which intersect at exactly one point. One can state various related coloring problems depending on the number $n$ of pseudolines. In this article, we show that $n$ colors are sufficient for coloring the crossings avoiding twice the same color on the boundary of any cell, or, alternatively, avoiding twice the same color along any pseudoline. We also study the problem of coloring the pseudolines avoiding monochromatic crossings. Comment: An extended abstract of this article was submitted to EuroCG2024 |
| نوع الوثيقة: | Working Paper |
| URL الوصول: | http://arxiv.org/abs/2402.12564 |
| رقم الانضمام: | edsarx.2402.12564 |
| قاعدة البيانات: | arXiv |
| الوصف غير متاح. |