scientific article; zbMATH DE number 3065933
From MaRDI portal
zbMath0043.04301MaRDI QIDQ5805073
de Bruijn, N. G., C. van Ebbenhorst Tengbergen, D. Kruyswijk
Publication date: 1951
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
The Schensted Correspondence and Lexicographic Matchings on Multisubset Lattices, The chromatic quasisymmetric class function of a digraph, An extremal problem for antichains of subsets of a multiset, Level sets in finite distributive lattices of breadth 3, Applications of the symmetric chain decomposition of the lattice of divisors, A \(k\)-order fuzzy OR operator for pattern classification with \(k\)-order ambiguity rejection, Decompositions of the Boolean lattice into rank-symmetric chains., The weak Lefschetz property for monomial ideals of small type, Bi-Lipschitz bijection between the Boolean cube and the Hamming ball, Partitions Into Chains of a Class of Partially Ordered Sets, Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory, Minimal generation of transitive permutation groups, Matchings, cutsets, and chain partitions in graded posets, Kleitman's conjecture about families of given size minimizing the number of \(k\)-chains, Infinitesimal variation functions for families of smooth varieties, On the structure of maximum 2-part Sperner families, Chain intersecting families, Order-matchings in the partition lattice, The poset on connected induced subgraphs of a graph need not be Sperner, Matching in power graphs of finite groups, Posets of shuffles, Symmetric decompositions and the strong Sperner property for noncrossing partition lattices, Saturated chains of subsets and a random walk, Problems on chain partitions, What can be said about pure O-sequences?, Nested chain partitions of Hamiltonian filters, When the nontrivial, small divisors of a natural number are in arithmetic progression, Supersaturation in posets and applications involving the container method, A local injective proof of log-concavity for increasing spanning forests, Applications of graph containers in the Boolean lattice, Uniform chain decompositions and applications, A combinatorial proof of the unimodality and symmetry of weak composition rank sequences, The EGH Conjecture and the Sperner property of complete intersections, Mineurs d'arbres avec racines, On the number of high‐dimensional partitions, Unnamed Item, Projection inequalities for antichains, Product partial orders with the Sperner property, Bijective mapping preserving intersecting antichains for \(k\)-valued cubes, Maximum antichains in posets of quiver representations, On the central levels problem, On maximal antichains containing no set and its complement, On the independence number of the power graph of a finite group, Unimodality of Gaussian coefficients: A constructive proof, Codes cycliques étendus affines-invariants et antichaines d'un ensemble partiellement ordonné. (Affine-invariant extended cyclic codes and antichains of a partially ordered set.), Symmetric chains, Gelfand--Tsetlin chains, and the Terwilliger algebra of the binary Hamming scheme, The Boolean rainbow Ramsey number of antichains, Boolean posets and chains, Multiset antichains having minimal downsets, On the number of non-dominated points of a multicriteria optimization problem, The linear chromatic number of a Sperner family, Numbers of generators of ideals in a group ring of an elementary Abelian \(p\)-group, Enhanced power graphs of groups are weakly perfect, Truncated convolution of the M\xF6bius function and multiplicative energy of an integer $n$, On Lipschitz Bijections Between Boolean Functions, Hamiltonian cycles and symmetric chains in Boolean lattices., On the structure of the lattice of noncrossing partitions, The size of the maximum antichains in products of linear orders, Inclusion matrices and chains, Syzygy bundles and the weak Lefschetz property of monomial almost complete intersections, Qualitative independence and Sperner problems for directed graphs, Matchings and the sum function, Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem, A statistic on involutions, Sperner's theorem with constraints, Sperner's theorem on maximal-sized antichains and its generalization, The morphology of partially ordered sets, Lexicographic matching in Boolean algebras, On the distribution of values of certain divisor functions, Another Three Part Sperner Theorem, When the Large Divisors of a Natural Number Are in Arithmetic Progression, The necklace poset is a symmetric chain order, A three part Sperner theorem, Some new results on the Littlewood-Offord problem, Strong versions of Sperner's theorem, Recursive matching algorithms and linear orders on the subset lattice, Explicit \(\Delta \)-edge-coloring of consecutive levels in a divisor lattice, On the distribution of sums of residues, Extremal theorems on divisors of a number, The minimal number of basic elements in a multiset antichain, Unnamed Item, Interval stability and interval covering property in finite posets, Ramsey-Sperner theory, Sperner properties for groups and relations, A generalization of results of P. Erdős, G. Katona, and D. J. Kleitman concerning Sperner's theorem, Non complete sums of multiplicative functions, Gray codes and symmetric chains, On certain sets of divisors of a number, A generalization of some generalizations of Sperner's theorem, On orthogonal symmetric chain decompositions, Inequalities concerning numbers of subsets of a finite set, Stronger form of an M-part Sperner theorem, Unnamed Item, Recognition of order-preserving maps, Symmetric chain decompositions of quotients by wreath products., Decompositions of \({\mathcal B}_ n\) and \({\varPi}_ n\) using symmetric chains, Partitioning the Boolean lattice into chains of large minimum size, Partitioning the Boolean lattice into a minimal number of chains of relatively uniform size, On the number of generators of ideals in local rings
