On a conjecture of Bollobas and Erdős

DOI10.1007/BF02018594zbMath0264.05121WikidataQ123138609 ScholiaQ123138609MaRDI QIDQ2561608

John L. Leonard

Publication date: 1973

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items

On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices, On extremal graphs with exactly one Steiner tree connecting any $k$ vertices, Coloring Graphs with Constraints on Connectivity, On k-rails in graphs

Cites Work

• Unnamed Item
• Unnamed Item