Consider any graph G $=($V$,$ E$)$ with $|$V $|=$ n nodes, where every node has degree at

least $10$n

$1/3$

log n$.$