Computer solution of the almost empty hexagon problem

DOI10.1134/S0001434611030163MaRDI QIDQ650447zbMATH OpenFDO

Authors V. A. Koshelev

Publication date 25 November 2011

Published in Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

signatureexhaustive searchalmost empty hexagonempty hexagonpoints in general position in the planeErdős-Szekeres problem

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10)

Recommendations

• The empty hexagon theorem
• Empty convex hexagons in planar point sets
• Almost empty hexagons
• On empty hexagons
• Empty convex hexagons in planar point sets

Cites work

• Computer solution to the 17-point Erdős-Szekeres problem
• Sets with No Empty Convex 7-Gons
• The Erdos-Szekeres problem on points in convex position – a survey

Cited in

(5)

• The Erdős-Szekeres Problem
• The empty hexagon theorem
• Solving \(7\times 7\) hex with domination, fill-in, and virtual connections
• scientific article; zbMATH DE number 800308 (Why is no real title available?)
• Almost empty monochromatic triangles in planar point sets

This page was built for publication: Computer solution of the almost empty hexagon problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q650447)