scientific article; zbMATH DE number 4029608
From MaRDI portal
Publication:3770569
Recommendations
Cited in
(only showing first 100 items - show all)- On t-intersecting families of signed sets and permutations
- The Erdős-Ko-Rado properties of various graphs containing singletons
- The Erdős-Ko-Rado properties of set systems defined by double partitions
- The number of faces of balanced Cohen-Macaulay complexes and a generalized Macaulay theorem
- Beyond the Erdős-Ko-Rado theorem
- Shadows and shifting
- Multiply-intersecting families
- A generalization of Fisher's inequality
- Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
- Proof of a conjecture of Frankl and Füredi
- More about shifting techniques
- Two extremal problems on intersecting families
- Two-regular subgraphs of odd-uniform hypergraphs
- Proof of the Erdős matching conjecture in a new range
- Regular bipartite graphs and intersecting families
- Non-trivially intersecting multi-part families
- Intersecting families, cross-intersecting families, and a proof of a conjecture of Feghali, Johnson and Thomas
- New injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems
- On families of sets without \(k\) pairwise disjoint members
- A generalization of Erdős' matching conjecture
- Erdős-Ko-Rado with conditions on the minimum complementary degree
- Random walks and multiply intersecting families
- The influence of variables in product spaces
- Matchings and covers in hypergraphs
- Transversal numbers for hypergraphs arising in geometry
- Weighted 3-wise 2-intersecting families
- Union of shadows
- Cross-intersecting families of finite sets
- Zero-sum problems -- a survey
- On the \(c\)-strong chromatic number of \(t\)-intersecting hypergraphs
- On cross t-intersecting families of sets
- On non-trivial families without a perfect matching
- Beyond the Erdős matching conjecture
- Old and new applications of Katona's circle
- Minimum degree and diversity in intersecting antichains
- On the \(d\)-cluster generalization of Erdős-Ko-Rado
- On the arithmetic mean of the size of cross-union families
- Tight bounds for Katona's shadow intersection theorem
- On strengthenings of the intersecting shadow theorem
- A short proof of Talbot's theorem for intersecting separated sets
- On the size of the product of overlapping families
- On the rainbow matching conjecture for 3-uniform hypergraphs
- The Hilton-Spencer cycle theorems via Katona's shadow intersection theorem
- A note on a conjecture of Bene Watts-Norin-Yepremyan for Lagrangian
- Maximizing \(2\)-independents sets in \(3\)-uniform hypergraphs
- The maximum sum of sizes of cross-intersecting families of subsets of a set
- Extremal t-intersecting families for direct products
- On the sum of sizes of overlapping families
- The Erdős matching conjecture and concentration inequalities
- An improved universal bound for \(t\)-intersecting families
- Erdős-Ko-Rado theorem for a restricted universe
- Cross-intersecting subfamilies of levels of hereditary families
- The maximum number of cliques in hypergraphs without large matchings
- A structure theorem for almost low-degree functions on the slice
- On the size of shadow-added intersecting families
- On the structure of minimal winning coalitions in simple voting games
- Classification of maximum hittings by large families
- A Kruskal-Katona type result and applications
- Families of finite sets satisfying intersection restrictions
- Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
- VC dimension and a union theorem for set systems
- AK-type stability theorems on cross t-intersecting families
- A discrete isodiametric result: the Erdős-Ko-Rado theorem for multisets
- The maximum product of sizes of cross-intersecting families
- A bipartite Erdős-Ko-Rado theorem
- Intersecting k-uniform families containing a given family
- Some exact results for multiply intersecting families
- Turán, involution and shifting
- Cross-intersecting non-empty uniform subfamilies of hereditary families
- Triangle-intersecting families of graphs
- Erdős-Ko-Rado theorems for simplicial complexes
- Hypergraph Turán numbers of linear cycles
- On Erdős' extremal problem on matchings in hypergraphs
- On the complexity of constrained VC-classes
- The maximum sum and the maximum product of sizes of cross-intersecting families
- Analogues of Katona's and Milner's theorems for two families
- On the maximum number of edges in hypergraphs with fixed matching and clique number
- Erdős matching conjecture for almost perfect matchings
- Non-trivial 3-wise intersecting uniform families
- Constructions of binary codes with two distances
- Erdős-Ko-Rado and Hilton-Milner theorems for two-forms
- Intersections and distinct intersections in cross-intersecting families
- The maximum measure of 3-wise t-intersecting families
- Intersection problems in the q-ary cube
- The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton-Milner family
- The maximum sum and product of sizes of cross-intersecting families
- EKR sets for large \(n\) and \(r\)
- Perfect matchings in hypergraphs and the Erdős matching conjecture
- Non-trivial intersecting uniform sub-families of hereditary families
- A Hilton-Milner-type theorem and an intersection conjecture for signed sets
- Intersecting k-uniform families containing all the k-subsets of a given set
- A short proof of an Erdős-Ko-Rado theorem for compositions
- How many colors guarantee a rainbow matching?
- On q-analogues and stability theorems
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
- scientific article; zbMATH DE number 736295 (Why is no real title available?)
- Isoperimetry in integer lattices
- On Mubayi's conjecture and conditionally intersecting sets
- Extremal problems for finite sets
- Geometric influences. II: Correlation inequalities and noise sensitivity
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)
