Uniform chain decompositions and applications
From MaRDI portal
Publication:6074684
DOI10.1002/rsa.21034arXiv1911.09533OpenAlexW3180345644MaRDI QIDQ6074684
Adam Zsolt Wagner, Benjamin Sudakov, István Tomon
Publication date: 12 October 2023
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.09533
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A random version of Sperner's theorem
- Boolean algebras and Lubell functions
- Problems on chain partitions
- On the number of graphs without 4-cycles
- Extremal properties of collections of subsets containing no two sets and their union
- Strong versions of Sperner's theorem
- Partitioning the Boolean lattice into chains of large minimum size
- Forbidden induced subposets of given height
- Extremal problems for sets forming Boolean algebras and complete partite hypergraphs
- Partitioning the Boolean lattice into a minimal number of chains of relatively uniform size
- On orthogonal symmetric chain decompositions
- Counting independent sets in graphs
- On a conjecture of Füredi.
- Set families with a forbidden subposet
- Decompositions of the Boolean lattice into rank-symmetric chains.
- Extensions of the linear bound in the Füredi-Hajnal conjecture
- A decomposition theorem for partially ordered sets
- Set Families With a Forbidden Induced Subposet
- Applications of graph containers in the Boolean lattice
- On Families of Subsets With a Forbidden Subposet
- The Asymptotic Number of Lattices
- Turánnical hypergraphs
- Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems
- On Collections of Subsets Containing No 4-Member Boolean Algebra
- On a problem of K. Zarankiewicz
