New Tricks for Old Trees: Maps and the Pigeonhole Principle

DOI10.2307/2974696zbMath0814.05028OpenAlexW4240486582MaRDI QIDQ4324554

No author found.

Publication date: 2 March 1995

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2974696

zbMATH Keywords

matchingspanning treepigeonhole principlehyercube

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)

Related Items (6)

On \(k\)-pairable graphs ⋮ The \(k\)-ball \(l\)-path branch weight centroid ⋮ On \(k\)-pairable regular graphs ⋮ Pair lengths of product graphs ⋮ On k-pairable graphs from trees ⋮ Enumerating spanning trees of graphs with an involution

This page was built for publication: New Tricks for Old Trees: Maps and the Pigeonhole Principle