On visibility and blockers

DOI10.20382/jocg.v1i1a3zbMath1408.52027arXiv0912.1150OpenAlexW2103602888MaRDI QIDQ2968067

Attila Pór, David R. Wood

Publication date: 9 March 2017

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

zbMATH Keywords

blocking setsvisibilityFreiman's theoremMotzkin-Rabin theoremRamsey-type conjectures

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Coloring of graphs and hypergraphs (05C15) Erd?s problems and related topics of discrete geometry (52C10) Ramsey theory (05D10) Inverse problems of additive number theory, including sumsets (11P70)

Related Items (5)

Edge colorings avoiding patterns ⋮ Every large point set contains many collinear points or an empty pentagon ⋮ Compact Grid Representation of Graphs ⋮ Recognition and complexity of point visibility graphs ⋮ On the connectivity of visibility graphs

This page was built for publication: On visibility and blockers