Helly-type theorems for appropriate colorings of visibility sets
For integers \(q\geq 1\), \(r\in \{0,\dots, q-1\}\) and \(n\geq 1\), let \(P\) be a set of \(qn+ r\) points \(p(1),\dots, p(nq+ r)\). Moreover, by \(p(nq+ r+ m)\), where \(m\geq 1\) is any integer, we mean \(p(nq+ r)\). Let \(V(i)= \{p(i),\dots, p(i+ q-1)\}\) for every integer \(i\) between \(1\) and \(nq+ r\). We say that a \(q\)-coloring of \(P\) is appropriate for a subfamily \({\mathcal S}\) of the family \(\{V(i): 1\leq i\leq qn+ r\}\) if \(q\) colors may be assigned to \(P\) (one color for each point) so that every \(V(i)\in{\mathcal S}\) contains \(q\) colors. The author proves that if for every \({\mathcal T}\subset{\mathcal S}\) consisting of \(2n-1\) sets the set \(P\) has all colorings appropriate for \({\mathcal T}\), then \(P\) has all colorings appropriate for \({\mathcal S}\). An example shows that the number \(2n-1\) cannot be lessened here.
- Coloring polygon visibility graphs and their generalizations
- On colourability of polygon visibility graphs
- The colorful Helly theorem and general hypergraphs
- The colorful Helly property for hypergraphs
- On the chromatic number of the visibility graph of a set of points in the plane
- Kőnig's line coloring and Vizing's theorems for graphings
- scientific article; zbMATH DE number 2156263
- Erdős-Ko-Rado-type theorems for colored sets
This page was built for publication: Helly-type theorems for appropriate colorings of visibility sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1601707)
