A proof of Frankl's union-closed sets conjecture for dismantlable lattices
From MaRDI portal
Publication:334974
Recommendations
- A structure theorem for dismantlable lattices and enumeration
- A note on the union-closed sets conjecture
- scientific article; zbMATH DE number 2065940
- scientific article; zbMATH DE number 729129
- scientific article; zbMATH DE number 528796
- On the union-closed sets conjecture
- Publication:4204156
- scientific article; zbMATH DE number 7122741
- A graph-theoretic version of the union-closed sets conjecture
- Note on the union-closed sets conjecture
Cites work
- scientific article; zbMATH DE number 5548454 (Why is no real title available?)
- scientific article; zbMATH DE number 3983158 (Why is no real title available?)
- scientific article; zbMATH DE number 1181276 (Why is no real title available?)
- scientific article; zbMATH DE number 3424071 (Why is no real title available?)
- A structure theorem for dismantlable lattices and enumeration
- Combinatorial inequalities for semimodular lattices of breadth two
- Crowns, Fences, and Dismantlable Lattices
- Frankl's conjecture and the dual covering property
- Lattices with Doubly Irreducible Elements
- Lower semimodular types of lattices: Frankl's conjecture holds for lower quasi-semimodular lattices
- On a class of finite lattices
- Partial orders of dimension 2
- Strong semimodular lattices and Frankl's conjecture
- Union-closed families
Cited in
(4)
This page was built for publication: A proof of Frankl's union-closed sets conjecture for dismantlable lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q334974)