arXiv (All)
open access
On the number of edges of restricted matchstick graphs
A graph whose vertices are points in the plane and whose edges are noncrossing straight-line segments of unit length is called a \emph{matchstick graph}. We prove two somewhat counterintuitive results concerning the maximum number of edges of such graphs in two different scenarios. First, we show th
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Monochromatic cycle partitions in 3-mean edge-colourings#1326368
- Logarithmic basis number of graphs and regular matroids#1084361
- A note on vertex-critical induced subgraphs of shift graphs#1052081
- Bull-free graphs and $χ$-boundedness#972374
- One and Seven-Eighths Divisibility Problems of Propp#1143094
Record · ID 1327233
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive