On a conjecture of Bollobas and Erdős

DOI10.1007/BF02018594MaRDI QIDQ2561608zbMATH OpenWikidataFDO

Authors John L. Leonard

Publication date 1973

Published in Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02018594

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cited in

(4)

• Coloring Graphs with Constraints on Connectivity
• On extremal graphs with exactly one Steiner tree connecting any k vertices
• On k-rails in graphs
• On extremal graphs with at most internally disjoint Steiner trees connecting any n-1 vertices

This page was built for publication: On a conjecture of Bollobas and Erdős

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