Computer solution of the almost empty hexagon problem

DOI10.1134/S0001434611030163zbMATH Open1270.52021MaRDI QIDQ650447FDOQ650447

Authors: V. A. Koshelev 

Publication date: 25 November 2011

Published in: Mathematical Notes (Search for Journal in Brave)

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

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)

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)

• Almost empty monochromatic triangles in planar point sets
• Title not available (Why is that?)
• The Erdős-Szekeres Problem
• The empty hexagon theorem
• Solving \(7\times 7\) hex with domination, fill-in, and virtual connections

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)