Packing the Boolean lattice with copies of a poset

DOI10.1112/jlms.12278zbMath1481.06019arXiv1804.06162OpenAlexW3103674449MaRDI QIDQ3296748

István Tomon

Publication date: 1 July 2020

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.06162

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Structure theory of lattices (06B05)

Related Items (1)

Turán-type results for intersection graphs of boxes

Cites Work

• Unnamed Item
• Set families with forbidden subposets
• Improved bounds on the partitioning of the Boolean lattice into chains of equal size.
• Problems on chain partitions
• Vertex coverings by monochromatic cycles and trees
• Partitions of large Boolean lattices
• Partitioning the Boolean lattice into copies of a poset
• Forbidden induced subposets of given height
• Almost tiling of the Boolean lattice with copies of a poset
• Set Families With a Forbidden Induced Subposet
• Tiling with arbitrary tiles
• Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems

This page was built for publication: Packing the Boolean lattice with copies of a poset