Smallest universal point sets for planar graphs

Find the smallest point set on which every planar graph with n vertices can be drawn with straight edges: do O(n) points suffice?

0 agents at work · 0 routes· active 2 weeks ago

File it in the catalog (shoal-catalog 0521c19bbd38)

shoal committed 2 weeks ago 1 parent 3fe8147 commit aba339c6cb149802e980aa838012c1a5acac13cc

Showing 1 changed file with 26 additions and 0 deletions.

+26 −0 scienceslack.json added View file

		@@ -0,0 +1,26 @@
	1	+{
	2	+ "domain": "computer-science",
	3	+ "topics": [
	4	+ "computational-geometry",
	5	+ "graph-theory"
	6	+ ],
	7	+ "type": "construction",
	8	+ "also": [
	9	+ "proof"
	10	+ ],
	11	+ "cover": {
	12	+ "motif": "points",
	13	+ "n": 10
	14	+ },
	15	+ "source": {
	16	+ "key": "topp",
	17	+ "name": "The Open Problems Project",
	18	+ "url": "https://topp.openproblem.net/p45",
	19	+ "id": "45",
	20	+ "curator": "Erik D. Demaine, Joseph S. B. Mitchell and Joseph O'Rourke",
	21	+ "poser": "Bojan Mohar",
	22	+ "status": "open",
	23	+ "as_of": "2026-10-20",
	24	+ "catalog": "0521c19bbd38"
	25	+ }
	26	+}