Lower bounds for piercing and coloring boxes

DOI10.1016/j.aim.2023.109360arXiv2209.09887OpenAlexW4387796921MaRDI QIDQ6187716

István Tomon

Publication date: 1 February 2024

Published in: Advances in Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2209.09887

zbMATH Keywords

Ramsey theoryboxeshitting set

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation algorithms for maximum independent set of pseudo-disks
• Covering boxes by points
• Covering and coloring problems for relatives of intervals
• On the number of graphs without 4-cycles
• On point covers of parallel rectangles
• Fast stabbing of boxes in high dimensions
• Piercing axis-parallel boxes
• On Wegner's inequality for axis-parallel rectangles
• Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity
• Über eine kombinatorisch-geometrische Frage von Hadwiger und Debrunner
• On a Coloring Problem.
• A Ramsey-Type Result for Convex Sets
• Tight lower bounds for the size of epsilon-nets
• Stochastic Algorithms: Foundations and Applications

This page was built for publication: Lower bounds for piercing and coloring boxes