scientific article
From MaRDI portal
Publication:3622544
zbMath1187.05002MaRDI QIDQ3622544
E. Tamás Schmidt, Gábor Czédli
Publication date: 28 April 2009
Full work available at URL: https://eudml.org/doc/32473
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
finite latticesemimodularityunion-closed sets conjectureFrankl's conjecturejoin-irreducible elementsfinit semimodular planar lattices
Permutations, words, matrices (05A05) Combinatorics of partially ordered sets (06A07) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items (7)
The union-closed sets conjecture almost holds for almost all random bipartite graphs ⋮ My collaboration with E. T. Schmidt spanning six decades ⋮ A proof of Frankl's union-closed sets conjecture for dismantlable lattices ⋮ Frankl's conjecture for subgroup lattices ⋮ Unnamed Item ⋮ The journey of the union-closed sets conjecture ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on planar semimodular lattices
- On the scope of averaging for Frankl's conjecture
- On averaging Frankl's conjecture for large union-closed-sets
- How to derive finite semimodular lattices from distributive lattices?
- Union-closed families
- Frankl's conjecture is true for modular lattices
- Excess of a lattice
- Strong semimodular lattices and Frankl's conjecture
- Lower semimodular types of lattices: Frankl's conjecture holds for lower quasi-semimodular lattices
- Frankl's conjecture is true for lower semimodular lattices
This page was built for publication:
