Original: A minor or subcontraction of a graph is any graph obtained by taking a subgraph and contracting some (or no) edges. Many graph properties are hereditary for minors, which means that a graph has a property if and only if all minors have it too.
Simplified: If any two nodes have an edge between them, then the graph is called the complete graph.