, Volume 31, Issue 3, pp 421–433

Diamond-Free Subsets in the Linear Lattices


DOI: 10.1007/s11083-013-9310-8

Cite this article as:
Sarkis, G., Shahriari, S. & PCURC Order (2014) 31: 421. doi:10.1007/s11083-013-9310-8


Four distinct elements a, b, c, and d of a poset form a diamond if \(a< b<d\) and \(a<c<d\). A subset of a poset is diamond-free if no four elements of the subset form a diamond. Even in the Boolean lattices, finding the size of the largest diamond-free subset remains an open problem. In this paper, we consider the linear lattices—poset of subspaces of a finite dimensional vector space over a finite field of order q—and extend the results of Griggs et al. (J. Combin. Theory Ser. A 119(2):310–322, 2012) on the Boolean lattices, to prove that the number of elements of a diamond-free subset of a linear lattice can be no larger than \(2+\frac {1}{q+1}\) times the width of the lattice, so that this fraction tends to 2 as \(q \longrightarrow \infty \). In addition, using an algebraic technique, we introduce so-called diamond matchings, and prove that for linear lattices of dimensions up to 5, the size of a largest diamond-free subset is equal to the sum of the largest two rank numbers of the lattice.


Diamond-free Linear lattices Subspace lattices Lubell function Forbidden poset 

Mathematics Subject Classifications (2010)

Primary 06A07; Secondary 05D05 05D15 

Copyright information

© Springer Science+Business Media Dordrecht 2013

Authors and Affiliations

  1. 1.Department of MathematicsPomona CollegeClaremontUSA

Personalised recommendations