A tight bound for the number of edges of matchstick graphs | NobleID

Main

Mint Work Search Explore Works Knowledge Graph Citation Graph Bibliometrics Receipts

v1

A tight bound for the number of edges of matchstick graphs

Identifier:nobleid.org/w1/20260515/8C010100

Type:Preprint

0 views

Support unavailableClaim Your Authorship

View Original Paper Source

Embeddable Badge

[![NobleID](https://www.nobleid.org/api/badge/8C010100.svg?ark=w1%2F20260515%2F8C010100)](https://nobleid.org/work/w1/20260515/8C010100)

ARK Inflections

Metadata Policy

Metadata Formats

Bibliometric Analysis

Impact metrics, research fronts, co-authorship networks →

Authors & Claims

Paper Authors

Jérémy Lavollée

Konrad J. Swanepoel

Claim authorship of this work

info@nobleid.org

About FAQ Terms Policy Persistence & Resolver Service Policy Pricing