Contents

Ars Combinatoria

  • Research article

Graphs of Extremal Weights

Béla Bollobdés1, Paul Erdos2
1 Department of Pure Mathematics and Mathematical Statistics University of Cambridge 16 Mill Lane Cambridge CB3 9AX England
2Mathematical Institute of the Hungarian Academy of Sciences Redltanoda utca 13-15 Budapest H-1053 Hungary
  • Published: 31/12/1998

Abstract

Our main aim is to show that the Randi\’e weight of a connected graph of order \(n\) is at least \(\sqrt{n – 1}\). As shown by the stars, this bound is best possible.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Béla Bollobdés, Paul Erdos. Graphs of Extremal Weights[J], Ars Combinatoria, Volume 050. 225-233. DOI: .