scientific article

Publication date: 1987

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

extremal set theory Kruskal-Katona theorem Sperner's theorem finite combinatorics Erdős-Ko- Rado theorem

Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Hypergraphs (05C65) Combinatorial inequalities (05A20)

Related Items (only showing first 100 items - show all)

Consistent global checkpoints based on direct dependency tracking ⋮ Edge isoperimetric inequalities for powers of the hypercube ⋮ Sixty years of network reliability ⋮ A class of posets with integral Laplacian spectrum ⋮ Forbidden induced subposets of given height ⋮ Solution of a research problem on trees of subsets ⋮ Another generalization of the Kruskal-Katona theorem ⋮ Applications of the symmetric chain decomposition of the lattice of divisors ⋮ Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets ⋮ Computational aspects of the 2-dimension of partially ordered sets ⋮ Lattice-based refinement in bounded model checking ⋮ Decompositions of the Boolean lattice into rank-symmetric chains. ⋮ On the density of sets of divisors ⋮ Extreme \(k\)-families ⋮ A generalization of Sperner's theorem on compressed ideals ⋮ Markovian log-supermodularity, and its applications in phylogenetics ⋮ Towards characterizing equality in correlation inequalities ⋮ A coding theoretic approach to extending designs ⋮ On specifying Boolean functions by labelled examples ⋮ Matchings, cutsets, and chain partitions in graded posets ⋮ Gotzmann theorems for exterior algebras and combinatorics ⋮ The cubical poset is additive ⋮ The normalized matching property from the generalized Macaulay theorem ⋮ The poset on connected induced subgraphs of a graph need not be Sperner ⋮ Maximum trees of finite sequences ⋮ Solving the job-shop scheduling problem optimally by dynamic programming ⋮ Some greedy \(t\)-intersecting families of finite sequences ⋮ The poset on connected graphs is Sperner ⋮ What can be said about pure O-sequences? ⋮ Characterizing profiles of \(k\)-families in additive Macaulay posets ⋮ Homomorphically full graphs ⋮ The complexity of embedding orders into small products of chains ⋮ Shadows and isoperimetry under the sequence-subsequence relation ⋮ Hilbert polynomials in combinatorics ⋮ Pseudo-LYM inequalities and AZ identities ⋮ ERCW PRAMs and optical communication ⋮ Supersaturation in posets and applications involving the container method ⋮ On ideals with the Rees property ⋮ An Erdős-Ko-Rado theorem for signed sets ⋮ A Meshalkin theorem for projective geometries ⋮ An upper bound on the sum of squares of degrees in a hypergraph ⋮ Constructive techniques for labeling constant weight Gray codes with applications to minimal generating sets of semigroups ⋮ Counting techniques to label constant weight Gray codes with links to minimal generating sets of semigroups ⋮ Finding lower bounds on the complexity of secret sharing schemes by linear programming ⋮ On \(k\)-hypertournament matrices ⋮ Unimodality of Gaussian coefficients: A constructive proof ⋮ Wide-sense 2-frameproof codes ⋮ Symmetric chains, Gelfand--Tsetlin chains, and the Terwilliger algebra of the binary Hamming scheme ⋮ The local Kostant-PBW ordering ⋮ New bounds on the maximum size of Sperner partition systems ⋮ Hamiltonian cycles and symmetric chains in Boolean lattices. ⋮ Symmetric difference-free and symmetric difference-closed collections of sets ⋮ Inclusion matrices and chains ⋮ Improved bounds on the partitioning of the Boolean lattice into chains of equal size. ⋮ A new result on Chvátal's conjecture ⋮ A Graham-Sloane type construction for \(s\)-surjective matrices ⋮ A combinatorial decomposition of acyclic simplicial complexes ⋮ Matchings and the sum function ⋮ The minimum number of disjoint pairs in set systems and related problems ⋮ Characterising nested database dependencies by fragments of propositional logic ⋮ The convex hull of antichains in posets ⋮ Algebraic shifting of strongly edge decomposable spheres ⋮ A combinatorial approach to nonlocality and contextuality ⋮ Nested chain partitions of LYM posets ⋮ Intersecting antichains and shadows in linear lattices ⋮ The homotopy classes of continuous maps between some nonmetrizable manifolds ⋮ Essential covers of the cube by hyperplanes ⋮ An Erdős-Ko-Rado theorem for restricted signed sets ⋮ Embeddings and other mappings of rooted trees into complete trees ⋮ Power indices and minimal winning coalitions ⋮ Adjacency on the order polytope with applications to the theory of fuzzy measures ⋮ Several families with incomparability and complementarity conditions ⋮ Proof of a conjecture on the Sperner property of the subgroup lattice of an Abelian \(p\)-group ⋮ A generalization of Talbot's theorem about King Arthur and his knights of the round table ⋮ A generalization of Sperner's theorem and an application to graph orientations ⋮ Kruskal-Katona function and variants of cross-intersecting antichains ⋮ Forbidden subposet problems in the grid ⋮ Cross-intersecting sub-families of hereditary families ⋮ Solution of a research problem ⋮ Investigating posets via their maximal chains ⋮ Shifting operations and graded Betti numbers ⋮ A note on a lemma of Brauer ⋮ Yet another generalization of the Kruskal-Katona theorem ⋮ Enumeration of certain finite semigroups of transformations ⋮ Voting fairly: Transitive maximal intersecting families of sets ⋮ The strong Hall property and symmetric chain orders ⋮ The numbers of dependent \(k\)-sets in a graph are log concave ⋮ Sets pooling designs ⋮ Most probably intersecting hypergraphs ⋮ Maximal sets of given diameter in the grid and the torus ⋮ On a conjecture of Füredi. ⋮ Decompositions of \({\mathcal B}_ n\) and \({\varPi}_ n\) using symmetric chains ⋮ Families implying the Frankl conjecture ⋮ Partitioning the Boolean lattice into chains of large minimum size ⋮ Maximizing Möbius functions on subsets of Boolean algebras ⋮ The width of random subsets of Boolean lattices ⋮ Non-empty cross-2-intersecting families of subsets ⋮ Partitioning the Boolean lattice into a minimal number of chains of relatively uniform size ⋮ On antichain intersection numbers, total clique covers and regular graphs ⋮ An Erdős--Ko--Rado theorem for partial permutations

This page was built for publication: