An Abstract Approach to Polychromatic Coloring: Shallow Hitting Sets in ABA-free Hypergraphs and Pseudohalfplanes

  • Balázs Keszegh
  • Dömötör  PálvölgyiEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9224)


The goal of this paper is to give a new, abstract approach to cover-decomposition and polychromatic colorings using hypergraphs on ordered vertex sets. We introduce an abstract version of a framework by Smorodinsky and Yuditsky, used for polychromatic coloring halfplanes, and apply it to so-called ABA-free hypergraphs, which are a generalization of interval graphs. Using our methods, we prove that \((2k-1)\)-uniform ABA-free hypergraphs have a polychromatic k-coloring, a problem posed by the second author. We also prove the same for hypergraphs defined on a point set by pseudohalfplanes. These results are best possible.

We also introduce several new notions that seem to be important for investigating polychromatic colorings and \(\epsilon \)-nets, such as shallow hitting sets. We pose several open problems related to them. For example, is it true that given a finite point set S on a sphere and a set of halfspheres \(\mathcal {F}\), such that \(\{S\cap F\mid F\in \mathcal {F}\}\) is a Sperner family, we can select an \(R\subset S\) such that \(1\le |F\cap R|\le 2\) holds for every \(F\in \mathcal {F}\)?


Interval Graph Color Classis Dual Version Pseudoline Arrangement Unbounded Convex 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.



We would like to thank the anonymous referees for their several useful suggestions and comments.


  1. 1.
    Björner, A., Las Vergnas, M., Sturmfels, B., White, N., Ziegler, G.: Oriented Matroids Encyclopedia of Mathematics and Its Applications 46. Cambridge University Press, Cambridge (1999)zbMATHGoogle Scholar
  2. 2.
    Cardinal, J., Knauer, K., Micek, P., Ueckerdt, T.: Making triangles colorful. J. Comput. Geom. 4, 240–246 (2013)MathSciNetGoogle Scholar
  3. 3.
    Cardinal, J., Knauer, K., Micek, P., Ueckerdt, T.: Making octants colorful and related covering decomposition problems. In: Proceedings of SODA 2014, pp. 1424–1432 (2014)Google Scholar
  4. 4.
    Dhandapani, R., Goodman, J.E., Holmsen, A., Pollack, R., Smorodinsky, S.: Convexity in topological affine planes. Discrete Comput. Geom. (DCG) 38, 243–257 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Fulek, R.: Coloring geometric hypergraph defined by an arrangement of half-planes. In: Proceedings of CCCG 2010, pp. 71–74 (2010)Google Scholar
  6. 6.
    Gibson, M., Varadarajan, K.: Decomposing coverings and the planar sensor cover problem. In: Proceedings of FOCS 2009, pp. 159–168 (2009)Google Scholar
  7. 7.
    Keszegh, B.: Weak conflict free colorings of point sets and simple regions. In: Proceedings of CCCG 2007, pp. 97–100 (2007)Google Scholar
  8. 8.
    Keszegh, B.: Coloring half-planes and bottomless rectangles. Comput. Geom. Theory Appl. 45(9), 495–507 (2012). ElsevierMathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Keszegh, B., Pálvölgyi, D.: Octants are cover decomposable. Discrete Comput. Geom. 47(3), 598–609 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Keszegh, B., Pálvölgyi, D.: Octants are cover decomposable into many coverings. Comput. Geom. Theory Appl. 47(5), 585–588 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Keszegh, B., Pálvölgyi, D.: Convex polygons are self-coverable. Discrete Comput. Geom. 51(4), 885–895 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Kovács, I.: Indecomposable coverings with homothetic polygons. arXiv:1312.4597
  13. 13.
    Pach, J., Pálvölgyi, D., Tóth, G.: Survey on decomposition of multiple coverings. In: Bárány, I., Böröczky, K.J., Fejes Tóth, G., Pach, J. (eds.) Geometry-Intuitive, Discrete, and Convex. Bolyai Society Mathematical Studies, vol. 24, pp. 219–257. Springer, Heidelberg (2014)Google Scholar
  14. 14.
    Pálvölgyi, D.: Indecomposable coverings with concave polygons. Discrete Comput. Geom. 44(3), 577–588 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Pálvölgyi, D.: Decomposition of Geometric Set Systems and Graphs. Ph.D. thesis (2010). arXiv:1009.4641
  16. 16.
    Pálvölgyi, D.: Indecomposable coverings with unit discs (2013). arXiv:1310.6900
  17. 17.
    Pálvölgyi, D., Tóth, G.: Convex polygons are cover-decomposable. Discrete Comput. Geom. 43(3), 483–496 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Smorodinsky, S.: Conflict-free coloring and its applications. In: Bárány, I., Böröczky, K.J., Fejes Tóth, G., Pach, J. (eds.) Geometry-Intuitive, Discrete, and Convex. Bolyai Society Mathematical Studies, vol. 24. Springer, Heidelberg (2014)Google Scholar
  19. 19.
    Smorodinsky, S., Yuditsky, Y.: Polychromatic coloring for half-planes. J. Comb. Theory Ser. A 119(1), 146–154 (2012)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  1. 1.Alfréd Rényi Institute of MathematicsBudapestHungary
  2. 2.Institute of MathematicsEötvös UniversityBudapestHungary

Personalised recommendations