A rank inequality for finite geometric lattices

DOI10.1016/S0021-9800(70)80090-4zbMath0254.05016MaRDI QIDQ5668819

Curtis Greene

Publication date: 1970

Published in: Journal of Combinatorial Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Modular lattices, Desarguesian lattices (06C05)

Related Items (25)

On finite matroids with two more hyperplanes than points ⋮ A new matching property for posets and existence of disjoint chains ⋮ Combinatorial inequalities for semimodular lattices of breadth two ⋮ Adjoints of matroids ⋮ The work of June Huh ⋮ The Slimmest Geometric Lattices ⋮ Combinatorics and Hodge theory ⋮ Combinatorial geometry takes the lead ⋮ Matching in modular lattices ⋮ An Inequality for the Möbius Function of a Geometric Lattice ⋮ Characterizing combinatorial geometries by numerical invariants ⋮ Consistent dually semimodular lattices ⋮ A property of the hyperplanes of a matroid and an extension of Dilworth's theorem ⋮ Unnamed Item ⋮ On the circuit-spectrum of binary matroids ⋮ Balanced sets and circuits in a transversal space ⋮ Right \(l\)-groups, geometric Garside groups, and solutions of the quantum Yang-Baxter equation ⋮ On a theorem of de Bruijn and Erdős ⋮ The Radon transforms of a combinatorial geometry, I ⋮ Whitney Number Inequalities for Geometric Lattices ⋮ Modular Constructions for Combinatorial Geometries ⋮ Embedding the planar structure of 4-dimensional linear spaces into projective spaces ⋮ Planar and affine spaces ⋮ On the number of lines in planar spaces ⋮ The minimum number of minimal codewords in an \([n, k\)-code and in graphic codes]

This page was built for publication: A rank inequality for finite geometric lattices