scientific article; zbMATH DE number 863493
From MaRDI portal
Publication:4871772
Recommendations
Cited in
(69)- On the scope of averaging for Frankl's conjecture
- On averaging Frankl's conjecture for large union-closed-sets
- Extremal systems with upper-bounded odd intersections
- Extremal problems under dimension constraints.
- Extremal problems for ordered (hyper)graphs: Applications of Davenport-Schinzel sequences
- Extremal set systems with restricted \(k\)-wise intersections.
- Lagrangian densities of some sparse hypergraphs and Turán numbers of their extensions
- Two results about the hypercube
- Intersecting families, cross-intersecting families, and a proof of a conjecture of Feghali, Johnson and Thomas
- Perfect matchings in antipodally colored lattice of subsets
- Almost disjoint families of 3-term arithmetic progressions
- A hypergraph extension of the bipartite Turán problem
- Multiply intersecting families of sets
- Extremal problems among subsets of a set
- The \(t\)-intersection problem in the truncated Boolean lattice
- Extremal cases of the Ahlswede-Cai inequality
- Extremal set systems with weakly restricted intersections
- A short proof of Talbot's theorem for intersecting separated sets
- The Hilton-Spencer cycle theorems via Katona's shadow intersection theorem
- The maximum sum of sizes of cross-intersecting families of subsets of a set
- Cross-intersecting subfamilies of levels of hereditary families
- Shattered matchings in intersecting hypergraphs
- Lagrangian densities of enlargements of matchings in hypergraphs
- Standard monomials and extremal point sets
- Shattering-extremal set systems from Sperner families
- Hypergraph cuts above the average
- Cross-intersecting families of vectors
- The maximum product of sizes of cross-intersecting families
- On quorum systems for group resources allocation
- Polynomal-size Frege proofs of Bollobás' theorem on the trace of sets
- Local bounds for the optimal information ratio of secret sharing schemes
- Cross-intersecting non-empty uniform subfamilies of hereditary families
- The maximum Lagrangian of 5-uniform hypergraphs without containing two edges intersecting at a vertex
- Cross-intersecting families of vectors
- The maximum product of weights of cross-intersecting families
- Some combinatorial applications of Gröbner bases
- Extremal Finite Set Theory
- scientific article; zbMATH DE number 4164914 (Why is no real title available?)
- scientific article; zbMATH DE number 5548454 (Why is no real title available?)
- Improved bounds for Erdős' matching conjecture
- A short proof of an Erdős-Ko-Rado theorem for compositions
- Extremal problems on set systems
- C-complete sets for compromise stable games
- A stability result on matchings in 3-uniform hypergraphs
- A sharp bound for the product of weights of cross-intersecting families
- Signal Processing on Simplicial Complexes
- On the maximum number of edges in a hypergraph with given matching number
- Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs
- Spectral radius and rainbow matchings of graphs
- r$r$‐Cross t$t$‐intersecting families via necessary intersection points
- Nearly extremal non-trivial cross t-intersecting families and r-wise t-intersecting families
- Spectral radius and rainbow Hamilton paths of a graph
- Lagrangian densities of 4-uniform matchings and degree stability of extremal hypergraphs
- Several minimality concepts related to Frankl's conjecture
- Signless Laplacian spectral conditions for the existence of rainbow k-factors in a collection of graphs
- A stability result for almost perfect matchings
- Testing intersecting and union-closed families
- A spectral generalized Erdős-Gallai theorem
- Frankl's conjecture.
- Singularities, expanders and topology of maps. II: From combinatorics to topology via algebraic isoperimetry
- Counting the maximum number of sunflowers in hypergraphs with given matching number
- Spectral radius and rainbow Hamiltonicity in bipartite graphs
- Average-rare order ideals in functional preorders
- Invitation to intersection problems for finite sets
- Strongly intersecting integer partitions
- FC-families and improved bounds for Frankl's conjecture
- Minimal connected -critical hypergraphs
- Stanley-Reisner rings with large multiplicities are Cohen-Macaulay
- Uniformly cross intersecting families
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4871772)
