Problem #PRU-30428

Problems Algebra Algebraic equations and systems of equations Higher order equations. Palindromic polynomial equations Equations of higher order (other) Calculus Real numbers Integer and fractional parts. Archimedean property
 12–14  2.0

Problem

Prove that a graph with n vertices, the degree of each of which is at least n−12, is connected.