Pith. sign in

REVIEW 1 cited by

Polychromatic Colorings of Unions of Geometric Hypergraphs

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2112.02894 v1 pith:2GRURV5O submitted 2021-12-06 math.CO cs.CGcs.DM

Vera Chekan , Torsten Ueckerdt This is my paper · ORCID
classification math.COcs.CGcs.DM
keywords hypergraphspolychromaticrectanglescoloringsgeometricunionsalgorithmsalia
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

We consider the polychromatic coloring problems for unions of two or more geometric hypergraphs on the same vertex sets of points in the plane. We show, inter alia, that the union of bottomless rectangles and horizontal strips does in general not allow for polychromatic colorings. This strengthens the corresponding result of Chen, Pach, Szegedy, and Tardos [Random Struct. Algorithms, 34:11-23, 2009] for axis-aligned rectangles, and gives the first explicit (not randomized) construction of non-$2$-colorable hypergraphs defined by axis-parallel rectangles of arbitrarily large uniformity.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Borel Polychromatic Number of Grids

    math.LO 2025-08 conditional novelty 7.0 of 10

    For free Borel Z^d-grids, every grid has a Borel (2^d-1)-polychromatic coloring, while ergodic grids admit no Borel 2^d-polychromatic coloring, so the Borel threshold is 2^d-1.

Pith tools