On orthogonal symmetric chain decompositions
From MaRDI portal
Publication:6621189
Recommendations
Cites work
- scientific article; zbMATH DE number 3065933 (Why is no real title available?)
- A SAT attack on the Erdős discrepancy conjecture
- A SAT attack on the Erdős-Szekeres conjecture
- A decomposition theorem for partially ordered sets
- A new method to construct lower bounds for van der Waerden numbers
- A short proof of the middle levels theorem
- Choice mappings of certain classes of finite sets
- Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers
- Ein Satz über Untermengen einer endlichen Menge.
- Gray codes and symmetric chains
- Improving Glucose for incremental SAT solving with assumptions: application to MUS extraction
- Lexicographic matching in Boolean algebras
- On a conjecture of Füredi.
- On a lemma of Littlewood and Offord on the distribution of certain sums
- On a lemma of Littlewood and Offord on the distributions of linear combinations of vectors
- On edge decompositions of posets
- On the Number of Real Roots of a Random Algebraic Equation
- Partitioning the Boolean lattice into copies of a poset
- Probabilities of Independent Choices Being Ordered
- Problems on chain partitions
- Proof of the middle levels conjecture
- Recursive matching algorithms and linear orders on the subset lattice
- Satisfiability and computing van der Waerden numbers
- Some quotients of chain products are symmetric chain orders
- Strong versions of Sperner's theorem
- The necklace poset is a symmetric chain order
- The van der Waerden NumberW(2, 6) Is 1132
- Theory and Applications of Satisfiability Testing
- Venn diagrams and symmetric chain decompositions in the Boolean lattice
This page was built for publication: On orthogonal symmetric chain decompositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6621189)
