A new generalization of the Erdős-Ko-Rado theorem

From MaRDI portal
Publication:5916418

DOI10.1016/0097-3165(86)90025-7zbMath0614.05001OpenAlexW153370943MaRDI QIDQ5916418

László Pyber

Publication date: 1986

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(86)90025-7




Related Items (56)

Combinatorics in the exterior algebra and the Bollobás Two Families TheoremThe maximum product of sizes of cross-intersecting familiesOn Disjoint Cross Intersecting Families of PermutationsThe Size of a Hypergraph and its Matching NumberCirculant almost cross intersecting familiesTwo extremal problems on intersecting familiesMulticolour SunflowersCross-intersecting families of finite setsDegree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjectureThe maximum sum of sizes of cross-intersecting families of subsets of a setFractional cross intersecting familiesRainbow Perfect Matchings for 4-Uniform HypergraphsCross-Intersecting Families of VectorsA semidefinite programming approach to a cross-intersection problem with measuresThe Boolean rank of the uniform intersection matrix and a family of its submatricesTreewidth of the Kneser graph and the Erdős-Ko-Rado theoremRegular bipartite graphs and intersecting familiesr$r$‐Cross t$t$‐intersecting families via necessary intersection pointsUniform hypergraphs under certain intersection constraints between hyperedgesThe maximum product of weights of cross-intersecting familiesImproved bounds for cross-Sperner systemsA non-trivial intersection theorem for permutations with fixed number of cyclesA product version of the Hilton-Milner theoremA product version of the Hilton-Milner-Frankl theoremMaximal fractional cross-intersecting familiesA proof of Frankl's conjecture on cross-union familiesA note on the maximum product-size of non-trivial cross \(t\)-intersecting familiesOn Rainbow Matchings for HypergraphsA Rainbow r-Partite Version of the Erdős–Ko–Rado TheoremIntersections and distinct intersections in cross-intersecting familiesOn cross \(t\)-intersecting families of setsAn Erdős-Ko-Rado theorem for cross \(t\)-intersecting familiesA sharp bound for the product of weights of cross-intersecting familiesSharp results concerning disjoint cross-intersecting familiesCross-intersecting pairs of hypergraphsA cross-intersection theorem for vector spaces based on semidefinite programmingA size-sensitive inequality for cross-intersecting familiesSome intersection theoremsA product version of the Erdős-Ko-Rado theoremMultiple cross-intersecting families of signed setsErdős-Ko-Rado with conditions on the minimum complementary degreeWhen are stars the largest cross-intersecting families?The maximum sum and the maximum product of sizes of cross-intersecting familiesOld and new applications of Katona's circleOn the arithmetic mean of the size of cross-union familiesOn subsets of the hypercube with prescribed Hamming distancesOn r-Cross Intersecting Families of SetsUnnamed ItemA cross‐intersection theorem for subsets of a setOn the size of the product of overlapping familiesOn the rainbow matching conjecture for 3-uniform hypergraphsOn \(r\)-cross \(t\)-intersecting families for weak compositionsA Deza-Frankl type theorem for set partitionsCross-intersecting families of vectorsThe exact bound in the Erdős-Ko-Rado theorem for cross-intersecting familiesOn maximal isolation sets in the uniform intersection matrix



Cites Work


This page was built for publication: A new generalization of the Erdős-Ko-Rado theorem