How Does One Cut a Triangle?

DOI10.1007/978-0-387-74652-4MaRDI QIDQ5423212zbMATH OpenOpenAlexFDO

Authors Alexander Soifer

Publication date 23 October 2007

Full work available at URL https://doi.org/10.1007/978-0-387-74652-4

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to geometry (51-01) Elementary problems in Euclidean geometries (51M04) Inequalities and extremum problems in real or complex geometry (51M16) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to convex and discrete geometry (52-01) Convex sets in (2) dimensions (including convex curves) (52A10) Erd?s problems and related topics of discrete geometry (52C10) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Recommendations

• scientific article; zbMATH DE number 45986
• scientific article; zbMATH DE number 3998653
• scientific article; zbMATH DE number 3347145
• scientific article; zbMATH DE number 1069337
• Partitions of planar sets into small triangles

Cited in

(3)

• scientific article; zbMATH DE number 45986 (Why is no real title available?)
• scientific article; zbMATH DE number 50077 (Why is no real title available?)
• An upper bound of Heilbronn number for eight points in triangles

This page was built for publication: How Does One Cut a Triangle?

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