On a conjecture of Bollobas and Erdős
From MaRDI portal
Publication:2561608
DOI10.1007/BF02018594zbMath0264.05121WikidataQ123138609 ScholiaQ123138609MaRDI QIDQ2561608
Publication date: 1973
Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)
05C35: Extremal problems in graph theory
Related Items
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 \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices
Cites Work