Minor Graph

A ``minor'' is a sort of Subgraph and is what Kuratowski means when he says ``contain.'' It is roughly asmall graph which can be mapped into the big one without merging Vertices.

• Kuratowski's Closure-Component Problem
• Kuratowski's Theorem
• Kurtosis
• Kähler Manifold
• König-Egeváry Theorem
• Königsberg Bridge Problem
• König's Theorem
• Kürschák's Tile
• L1-Norm
• L2-Norm
• L2-Space
• Labeled Graph
• Lacunarity
• Ladder
• Ladder Graph
• Lagrange Bracket
• Lagrange-Bürmann Theorem
• Lagrange Expansion
• Lagrange Interpolating Polynomial
• Lagrange Inversion Theorem
• Lagrange Multiplier
• Lagrange Number (Diophantine Equation)
• Lagrange Number (Rational Approximation)
• Lagrange Polynomial
• Lagrange Remainder