scientific article; zbMATH DE number 4029608
From MaRDI portal
Publication:3770569
zbMATH Open0633.05038MaRDI QIDQ3770569FDOQ3770569
Publication date: 1987
Title of this publication is not available (Why is that?)
Recommendations
survey paperextremal set theoryintersecting familiesHilton-Milner theoremKruskal-Katona theoremshiftingErdős-Ko-Rado theoremBrace-Daykin theorem
Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Hypergraphs (05C65)
Cited In (only showing first 100 items - show all)
- A refined result on cross-intersecting families
- Shadows and shifting
- Intersecting \(k\)-uniform families containing all the \(k\)-subsets of a given set
- On \(q\)-analogues and stability theorems
- A product version of the Erdős-Ko-Rado theorem
- The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families
- Random walks and multiply intersecting families
- The Erdős-Ko-Rado properties of various graphs containing singletons
- The Erdős-Ko-Rado properties of set systems defined by double partitions
- How many colors guarantee a rainbow matching?
- Erdős-Ko-Rado theorems for simplicial complexes
- On Chvàtal's conjecture and a conjecture on families of signed sets
- Title not available (Why is that?)
- Intersection problems in the \(q\)-ary cube
- EKR type inequalities for 4-wise intersecting families
- Intersecting families in \(\begin{pmatrix}[m]\\ \ell\end{pmatrix}\cup\begin{pmatrix}[n]\\ k\end{pmatrix}\)
- Intersecting families, cross-intersecting families, and a proof of a conjecture of Feghali, Johnson and Thomas
- Proof of the Erdős matching conjecture in a new range
- A generalization of Erdős' matching conjecture
- Beyond the Erdős matching conjecture
- The Erdős matching conjecture and concentration inequalities
- A bipartite Erdős-Ko-Rado theorem
- More about shifting techniques
- A generalization of Fisher's inequality
- Erdős matching conjecture for almost perfect matchings
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
- Uniform intersecting families with large covering number
- The maximum sum of sizes of cross-intersecting families of subsets of a set
- Multiply-intersecting families
- The number of faces of balanced Cohen-Macaulay complexes and a generalized Macaulay theorem
- Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
- The maximum product of sizes of cross-intersecting families
- A short proof of an Erdős-Ko-Rado theorem for compositions
- Zero-sum problems -- a survey
- EKR sets for large \(n\) and \(r\)
- Cross-intersecting families of permutations
- Spaces of \(p\)-vectors of bounded rank
- AK-type stability theorems on cross \(t\)-intersecting families
- A Hilton-Milner-type theorem and an intersection conjecture for signed sets
- The maximum sum and product of sizes of cross-intersecting families
- On the \(c\)-strong chromatic number of \(t\)-intersecting hypergraphs
- A discrete isodiametric result: the Erdős-Ko-Rado theorem for multisets
- Maximum hitting of a set by compressed intersecting families
- The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton-Milner family
- Maximum hitting for \(n\) sufficiently large
- Two-regular subgraphs of odd-uniform hypergraphs
- Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
- The influence of variables in product spaces
- Multiple cross-intersecting families of signed sets
- On \(t\)-intersecting families of signed sets and permutations
- Families of finite sets satisfying intersection restrictions
- Intersecting \(k\)-uniform families containing a given family
- Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture
- The maximum sum and the maximum product of sizes of cross-intersecting families
- On Erdős' extremal problem on matchings in hypergraphs
- Matchings and covers in hypergraphs
- Non-trivial \(r\)-wise intersecting families
- Geometric influences. II: Correlation inequalities and noise sensitivity
- Families with no perfect matchings
- Beyond the Erdős-Ko-Rado theorem
- Some good characterization results relating to the Kőnig-Egerváry theorem
- A cross‐intersection theorem for subsets of a set
- Weighted 3-wise 2-intersecting families
- A sharp bound for the product of weights of cross-intersecting families
- On cross \(t\)-intersecting families of sets
- Some exact results for multiply intersecting families
- Transversal numbers for hypergraphs arising in geometry
- Invitation to intersection problems for finite sets
- Strongly intersecting integer partitions
- Cross-intersecting sub-families of hereditary families
- The maximum size of intersecting and union families of sets
- Cross-intersecting pairs of hypergraphs
- A structural result for 3-graphs
- Hypergraph Turán numbers of linear cycles
- Non-trivial intersecting uniform sub-families of hereditary families
- On the maximum number of edges in a hypergraph with given matching number
- Triangle-intersecting families of graphs
- On strengthenings of the intersecting shadow theorem
- Tight bounds for Katona's shadow intersection theorem
- Non-trivial 3-wise intersecting uniform families
- A structure theorem for almost low-degree functions on the slice
- On non-trivial families without a perfect matching
- On Mubayi's Conjecture and Conditionally Intersecting Sets
- Spectral radius and rainbow Hamilton paths of a graph
- Simple juntas for shifted families
- Improved bounds concerning the maximum degree of intersecting hypergraphs
- Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
- New injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems
- The structure of maximal non-trivial \(d\)-wise intersecting uniform families with large sizes
- On the complexity of constrained VC-classes
- Union of shadows
- On the \(d\)-cluster generalization of Erdős-Ko-Rado
- Erdős-Ko-Rado with conditions on the minimum complementary degree
- Title not available (Why is that?)
- Families with restricted matching number and multiply covered shadows
- A proof of Frankl's conjecture on cross-union families
- Non-trivial \(t\)-intersecting separated families
- Old and new applications of Katona's circle
- Minimum degree and diversity in intersecting antichains
- On families with bounded matching number
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 Q3770569)