An explicit 1-factorization in the middle of the Boolean lattice (Q1320401): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0097-3165(94)90030-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1982120981 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit matchings in the middle levels of the Boolean lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sharp bound for the number of sets that pairwise intersect at \(k\) positive values / rank
 
Normal rank

Latest revision as of 13:49, 22 May 2024

scientific article
Language Label Description Also known as
English
An explicit 1-factorization in the middle of the Boolean lattice
scientific article

    Statements

    An explicit 1-factorization in the middle of the Boolean lattice (English)
    0 references
    0 references
    0 references
    0 references
    7 September 1994
    0 references
    Let \(R_ j\) be the collection of \(j\)-element subsets of \(\{1,2, \dots, 2k+1\}\), and let \(B_ k\) be the bipartite graph defined on \(R_ k \cup R_{k+1}\) by letting \(A\) be adjacent to \(B\) if and only if \(A \subset B\) or vice versa. The authors define explicitly a 1-factorization of \(B_ k\) whose constituent matchings are defined using addition mod \(k+1\). They show that the matchings are invariant under rotation, they describe the effect of reflection, they show that there are no other symmetries that map these matchings among themselves, and they prove that they are distinct from the lexical matchings in \(B_ k\) (for lexical factorization see [\textit{H. A. Kierstead} and \textit{W. T. Trotter}, Explicit matchings in the middle levels of the Boolean lattice, Order 5, No. 2, 163-171 (1988; Zbl 0668.05045)]).
    0 references
    Boolean lattice
    0 references
    1-factorization
    0 references
    matchings
    0 references

    Identifiers