Applying a result of Frankl and Rödl to the construction of Steiner trees in the hypercube

DOI10.1016/0012-365X(94)90383-2zbMath0803.05017MaRDI QIDQ1332422

Zevi Miller, Dan Pritikin

Publication date: 2 January 1995

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

hypercubeSteiner problemSteiner trees

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Cites Work

• Lower bounds for Turán's problem
• Steiner problem in networks: A survey
• The steiner problem in the hypercube
• Steiner's problem in graphs and its implications

This page was built for publication: Applying a result of Frankl and Rödl to the construction of Steiner trees in the hypercube