New Tricks for Old Trees: Maps and the Pigeonhole Principle

New Tricks for Old Trees: Maps and the Pigeonhole Principle

The theorem that for every spanning tree T of the hypercube Qn, there exists an edge e in E(Qn) minus E(T) whose addition to T forms a cycle of length at least 2n is proved.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:The American mathematical monthly 1994-08, Vol.101 (7), p.664-667
Hauptverfasser: Graham, N., Entringer, R. C., Székely, L. A.
Format: Artikel
Sprache:eng
Schlagworte:
Discrete mathematics
Mathematics
Vertices
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The theorem that for every spanning tree T of the hypercube Qn, there exists an edge e in E(Qn) minus E(T) whose addition to T forms a cycle of length at least 2n is proved.
ISSN:0002-9890
1930-0972
DOI:10.1080/00029890.1994.11997009