MathDB
Miklos Schweitzer 1980_3

Source: lattice

January 28, 2009
superior algebrasuperior algebra unsolved

Problem Statement

In a lattice, connected the elements a∧b a \wedge b and a∨b a \vee b by an edge whenever a a and b b are incomparable. Prove that in the obtained graph every connected component is a sublattice. M. Ajtai
Back to ProblemsView on AoPS