✳flâneur — a map of the web's best reading
piercing intervals - gyarfas
arxiv.org · 239 words · saved by 1 readers
N/A
Clique covers of complete graphs and piercing multitrack intervals Assume that $R_1,R_2,\dots,R_t$ are disjoint parallel lines in the plane. A $t$-interval (or $t$-track interval) is a set that can be written as the union of $t$ closed intervals, each on a different line. It is known that pairwise intersecting $2$-intervals can be pierced by two points, one from each line. However, it is not true that every set of pairwise intersecting $3$-intervals can be pierced by three points, one from each line. For $k\ge 3$, Kaiser and Rabinovich asked whether $k$-wise intersecting $t$-intervals can be
Explore this link on the map →saved by
related reading
- 02_GyarfasLehel_AHellyTypeProblemInTrees.pdfusers.renyi.hu
- Exact Stability for Turan's Theoremarxiv.org
- rainbow-turan-full-version.pdfpeople.maths.ox.ac.uk
- 2-reachable subsets in two-colored graphsarxiv.org
- Rainbow Turán Problemspeople.math.ethz.ch
- [2604.04115] Gallai 3-colourings of random graphsarxiv.org
- [2604.27639] How large part of a graph can be covered by the neighborhoods of k vertices?arxiv.org
- parity edge coloringmilans.us
- nullstellensatzweb.math.princeton.edu
- random subgraphs rainbowarxiv.org
- rainbow treesarxiv.org
- [2305.02725] Two-round Ramsey games on random graphsarxiv.org