A size-sensitive inequality for cross-intersecting families
From MaRDI portal
Publication:518199
DOI10.1016/j.ejc.2017.01.004zbMath1358.05295arXiv1603.00936OpenAlexW2962957045MaRDI QIDQ518199
Peter Frankl, Andrey B. Kupavskii
Publication date: 28 March 2017
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.00936
Related Items
On the maximum number of edges in hypergraphs with fixed matching and clique number, A refined result on cross-intersecting families, Regular bipartite graphs and intersecting families, r$r$‐Cross t$t$‐intersecting families via necessary intersection points, A generalization of Kneser graphs, A product version of the Hilton-Milner theorem, A note on the maximum product-size of non-trivial cross \(t\)-intersecting families, Uniform s-Cross-Intersecting Families, Sharp results concerning disjoint cross-intersecting families, Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles
Cites Work
- The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families
- Intersecting and cross-intersecting families of labeled sets
- A generalization of a theorem of Kruskal
- Families of finite sets with minimum shadows
- Some best possible inequalities concerning cross-intersecting families
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- THE ERDÖS–KO–RADO THEOREM WITH VALENCY CONDITIONS
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- A new generalization of the Erdős-Ko-Rado theorem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
