New Tricks for Old Trees: Maps and the Pigeonhole Principle

DOI10.2307/2974696zbMATH Open0814.05028OpenAlexW4240486582MaRDI QIDQ4324554FDOQ4324554

Authors

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) Distance in graphs (05C12) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Spanning graphs of hypercubes: Starlike and double starlike trees
• On Hamiltonian circuits and spanning trees of hypercubes
• On the spanning tree packing number of a graph: A survey
• An extremal theorem in the hypercube
• Spanning subgraphs of a hypercube. IV: Rooted trees

Cited in

(7)

• The \(k\)-ball \(l\)-path branch weight centroid
• On \(k\)-pairable graphs
• Enumerating spanning trees of graphs with an involution
• Pair lengths of product graphs
• The edge slide graph of the 3-cube
• On \(k\)-pairable regular graphs
• On k-pairable graphs from trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4324554)