scientific article; zbMATH DE number 863493
From MaRDI portal
zbMath0844.05094MaRDI QIDQ4871772
Publication date: 22 August 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
FC-families and improved bounds for Frankl's conjecture, The maximum product of sizes of cross-intersecting families, A Stability Result on Matchings in 3-Uniform Hypergraphs, Signal Processing on Simplicial Complexes, On quorum systems for group resources allocation, Polynomal-size Frege proofs of Bollobás' theorem on the trace of sets, Minimal connected \(\tau\)-critical hypergraphs, Stanley-Reisner rings with large multiplicities are Cohen-Macaulay, The maximum sum of sizes of cross-intersecting families of subsets of a set, Lagrangian densities of some sparse hypergraphs and Turán numbers of their extensions, Two results about the hypercube, Improved bounds for Erdős' matching conjecture, Cross-Intersecting Families of Vectors, The maximum Lagrangian of 5-uniform hypergraphs without containing two edges intersecting at a vertex, Local bounds for the optimal information ratio of secret sharing schemes, Cross-intersecting subfamilies of levels of hereditary families, Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs, A short proof of an Erdős-Ko-Rado theorem for compositions, Spectral radius and rainbow matchings of graphs, Cross-intersecting non-empty uniform subfamilies of hereditary families, r$r$‐Cross t$t$‐intersecting families via necessary intersection points, The maximum product of weights of cross-intersecting families, Unnamed Item, Intersecting families, cross-intersecting families, and a proof of a conjecture of Feghali, Johnson and Thomas, Extremal problems under dimension constraints., Extremal problems for ordered (hyper)graphs: Applications of Davenport-Schinzel sequences, C-complete sets for compromise stable games, Shattered matchings in intersecting hypergraphs, A sharp bound for the product of weights of cross-intersecting families, Some Combinatorial Applications of Gröbner Bases, On the maximum number of edges in a hypergraph with given matching number, Perfect matchings in antipodally colored lattice of subsets, Almost disjoint families of 3-term arithmetic progressions, Singularities, expanders and topology of maps. II: From combinatorics to topology via algebraic isoperimetry, Uniformly cross intersecting families, Invitation to intersection problems for finite sets, Lagrangian densities of enlargements of matchings in hypergraphs, Strongly intersecting integer partitions, Standard monomials and extremal point sets, On the scope of averaging for Frankl's conjecture, Shattering-extremal set systems from Sperner families, On averaging Frankl's conjecture for large union-closed-sets, A short proof of Talbot's theorem for intersecting separated sets, A hypergraph extension of the bipartite Turán problem, Multiply intersecting families of sets, Hypergraph cuts above the average, Cross-intersecting families of vectors, The Hilton-Spencer cycle theorems via Katona's shadow intersection theorem, The \(t\)-intersection problem in the truncated Boolean lattice
