Talk:Dense subgraph

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

should subgraph density be defined similarly to graph density? graph density is |E| / choose(|V|, 2), yet subgraph density here is defined as |E| / |V|.

Mmuurr (talk) 20:10, 12 July 2013 (UTC)

Example incorrect

The example does not show the densest subgraph ... the induced graph $G'=(V' = \{b,c,d,e,f,g,h\}, \choose{V'}{2} \cap E(G))$ has density $d_{G'} = \frac{10}{7} = 1.428571 > 1.4 = \frac{7}{5}$ — Preceding unsigned comment added by (talk) 13:07, 12 August 2014 (UTC)

Retrieved from ""
This content was retrieved from Wikipedia :
This page is based on the copyrighted Wikipedia article "Talk:Dense subgraph"; it is used under the Creative Commons Attribution-ShareAlike 3.0 Unported License (CC-BY-SA). You may redistribute it, verbatim or modified, providing that you comply with the terms of the CC-BY-SA