Extremal graphs for weights

Béla Bollobás, Paul Erdos, Amites Sarkar

Research output: Contribution to journalArticle

47 Citations (Scopus)


Given a graph G = (V,E) and α ∈ ℝ, we write Wα(G) = ∑xy∈E dG(X)αdG(y)α and study the function wα(m)= max{wα(G): e(G) = m}. Answering a question from Bollobás and Erdos (Graphs of external weights, to appear), we determine w1(m) for every m, and we also give bounds for the case α ≠ 1.

Original languageEnglish
Pages (from-to)5-19
Number of pages15
JournalDiscrete Mathematics
Issue number1-3
Publication statusPublished - Apr 6 1999

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'Extremal graphs for weights'. Together they form a unique fingerprint.

  • Cite this