Regular matchstick graphs

Sascha Kurz; Rom Pinchasi

doi:10.4169/amer.math.monthly.118.03.264

Regular matchstick graphs

Sascha Kurz, Rom Pinchasi

Mathematics

Technion - Israel Institute of Technology

Research output: Contribution to journal › Article › peer-review

Abstract

A matchstick graph is a plane geometric graph in which every edge has length 1 and no two edges cross each other. It was conjectured that no 5-regular matchstick graph exists. In this paper we prove this conjecture.

Original language	English
Pages (from-to)	264-267
Number of pages	4
Journal	American Mathematical Monthly
Volume	118
Issue number	3
DOIs	https://doi.org/10.4169/amer.math.monthly.118.03.264
State	Published - Mar 2011

All Science Journal Classification (ASJC) codes

General Mathematics

Access to Document

10.4169/amer.math.monthly.118.03.264

Cite this

@article{6ee6f7b35f1a41df9bd38ed1caf45c46,

title = "Regular matchstick graphs",

abstract = "A matchstick graph is a plane geometric graph in which every edge has length 1 and no two edges cross each other. It was conjectured that no 5-regular matchstick graph exists. In this paper we prove this conjecture.",

author = "Sascha Kurz and Rom Pinchasi",

year = "2011",

month = mar,

doi = "10.4169/amer.math.monthly.118.03.264",

language = "الإنجليزيّة",

volume = "118",

pages = "264--267",

journal = "American Mathematical Monthly",

issn = "0002-9890",

publisher = "Taylor and Francis Ltd.",

number = "3",

}

TY - JOUR

T1 - Regular matchstick graphs

AU - Kurz, Sascha

AU - Pinchasi, Rom

PY - 2011/3

Y1 - 2011/3

N2 - A matchstick graph is a plane geometric graph in which every edge has length 1 and no two edges cross each other. It was conjectured that no 5-regular matchstick graph exists. In this paper we prove this conjecture.

AB - A matchstick graph is a plane geometric graph in which every edge has length 1 and no two edges cross each other. It was conjectured that no 5-regular matchstick graph exists. In this paper we prove this conjecture.

UR - http://www.scopus.com/inward/record.url?scp=79952922994&partnerID=8YFLogxK

U2 - 10.4169/amer.math.monthly.118.03.264

DO - 10.4169/amer.math.monthly.118.03.264

M3 - مقالة

SN - 0002-9890

VL - 118

SP - 264

EP - 267

JO - American Mathematical Monthly

JF - American Mathematical Monthly

IS - 3

ER -

Regular matchstick graphs

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Cite this