1 paper
Zhanar Berikkyzy, Kirsten Hogenson, Rachel Kirsch +1
Erdős proved an upper bound on the number of edges in an n-vertex non-Hamiltonian graph with given minimum degree and showed sharpness via two members of a particular graph famil…