The following pages link to (Q3741626):
Displaying 50 items.
- A generalization of Sperner's theorem on compressed ideals (Q311527) (← links)
- Solving the job-shop scheduling problem optimally by dynamic programming (Q339631) (← links)
- On ideals with the Rees property (Q387593) (← links)
- Hamiltonian cycles and symmetric chains in Boolean lattices. (Q489325) (← links)
- Symmetric difference-free and symmetric difference-closed collections of sets (Q489349) (← links)
- Improved bounds on the partitioning of the Boolean lattice into chains of equal size. (Q501073) (← links)
- The minimum number of disjoint pairs in set systems and related problems (Q524186) (← links)
- Intersecting antichains and shadows in linear lattices (Q549257) (← links)
- The complexity of embedding orders into small products of chains (Q603886) (← links)
- Symmetric chains, Gelfand--Tsetlin chains, and the Terwilliger algebra of the binary Hamming scheme (Q644673) (← links)
- A Graham-Sloane type construction for \(s\)-surjective matrices (Q685994) (← links)
- A combinatorial decomposition of acyclic simplicial complexes (Q687119) (← links)
- Matchings and the sum function (Q687124) (← links)
- Cross-intersecting sub-families of hereditary families (Q765869) (← links)
- Investigating posets via their maximal chains (Q781532) (← links)
- An Erdős--Ko--Rado theorem for partial permutations (Q817754) (← links)
- Markovian log-supermodularity, and its applications in phylogenetics (Q845658) (← links)
- Unimodality of Gaussian coefficients: A constructive proof (Q911594) (← links)
- Inclusion matrices and chains (Q942174) (← links)
- Algebraic shifting of strongly edge decomposable spheres (Q966065) (← links)
- A generalization of Talbot's theorem about King Arthur and his knights of the round table (Q1024989) (← links)
- A generalization of Sperner's theorem and an application to graph orientations (Q1026119) (← links)
- What can be said about pure O-sequences? (Q1117227) (← links)
- ERCW PRAMs and optical communication (Q1128717) (← links)
- The local Kostant-PBW ordering (Q1175976) (← links)
- A new result on Chvátal's conjecture (Q1194757) (← links)
- The convex hull of antichains in posets (Q1204518) (← links)
- Proof of a conjecture on the Sperner property of the subgroup lattice of an Abelian \(p\)-group (Q1272363) (← links)
- Solution of a research problem (Q1286668) (← links)
- The strong Hall property and symmetric chain orders (Q1301661) (← links)
- Sets pooling designs (Q1306748) (← links)
- Maximal sets of given diameter in the grid and the torus (Q1313846) (← links)
- Decompositions of \({\mathcal B}_ n\) and \({\varPi}_ n\) using symmetric chains (Q1317461) (← links)
- Maximizing Möbius functions on subsets of Boolean algebras (Q1318819) (← links)
- Non-empty cross-2-intersecting families of subsets (Q1319142) (← links)
- On antichain intersection numbers, total clique covers and regular graphs (Q1322237) (← links)
- Consistent global checkpoints based on direct dependency tracking (Q1327322) (← links)
- Solution of a research problem on trees of subsets (Q1335406) (← links)
- Another generalization of the Kruskal-Katona theorem (Q1336454) (← links)
- Applications of the symmetric chain decomposition of the lattice of divisors (Q1337572) (← links)
- On the density of sets of divisors (Q1343798) (← links)
- Extreme \(k\)-families (Q1345523) (← links)
- Gotzmann theorems for exterior algebras and combinatorics (Q1357556) (← links)
- The cubical poset is additive (Q1357719) (← links)
- Some greedy \(t\)-intersecting families of finite sequences (Q1367107) (← links)
- Characterizing profiles of \(k\)-families in additive Macaulay posets (Q1374193) (← links)
- Shadows and isoperimetry under the sequence-subsequence relation (Q1382388) (← links)
- Hilbert polynomials in combinatorics (Q1383811) (← links)
- Pseudo-LYM inequalities and AZ identities (Q1384026) (← links)
- An Erdős-Ko-Rado theorem for signed sets (Q1388967) (← links)
