scientific article

From MaRDI portal
Revision as of 12:14, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3770569

zbMath0633.05038MaRDI QIDQ3770569

Peter Frankl

Publication date: 1987


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (only showing first 100 items - show all)

The maximum product of sizes of cross-intersecting familiesIntersection problems in the \(q\)-ary cubeA bipartite Erdős-Ko-Rado theoremIntersecting families in \(\begin{pmatrix}[m\\ \ell\end{pmatrix}\cup\begin{pmatrix}[n]\\ k\end{pmatrix}\)] ⋮ EKR sets for large \(n\) and \(r\)Union of shadowsIntersecting \(k\)-uniform families containing a given familyTwo extremal problems on intersecting familiesSphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimensionA note on a conjecture of bene Watts-Norin-Yepremyan for LagrangianCross-intersecting families of finite setsThe number of faces of balanced Cohen-Macaulay complexes and a generalized Macaulay theoremMaximizing \(2\)-independents sets in \(3\)-uniform hypergraphsProof of a conjecture of Frankl and FürediThe maximum sum of sizes of cross-intersecting families of subsets of a setOn the sum of sizes of overlapping familiesThe Erdős matching conjecture and concentration inequalitiesZero-sum problems -- a surveyEKR type inequalities for 4-wise intersecting familiesOn Chvàtal's conjecture and a conjecture on families of signed setsAn improved universal bound for \(t\)-intersecting familiesNon-trivial intersecting uniform sub-families of hereditary familiesA Hilton-Milner-type theorem and an intersection conjecture for signed setsTwo-regular subgraphs of odd-uniform hypergraphsErdős-Ko-Rado theorem for a restricted universeCross-intersecting subfamilies of levels of hereditary familiesIntersecting \(k\)-uniform families containing all the \(k\)-subsets of a given setProof of the Erdős matching conjecture in a new rangeA short proof of an Erdős-Ko-Rado theorem for compositionsHow many colors guarantee a rainbow matching?Regular bipartite graphs and intersecting familiesSome exact results for multiply intersecting familiesTurán, involution and shiftingCross-intersecting non-empty uniform subfamilies of hereditary familiesOn \(q\)-analogues and stability theoremsMore about shifting techniquesSome good characterization results relating to the Kőnig-Egerváry theoremTriangle-intersecting families of graphsLarge matchings in uniform hypergraphs and the conjectures of Erdős and samuelsOn the \(c\)-strong chromatic number of \(t\)-intersecting hypergraphsErdős-Ko-Rado theorems for simplicial complexesNon-trivially intersecting multi-part familiesThe maximum number of cliques in hypergraphs without large matchingsPerfect matchings (and Hamilton cycles) in hypergraphs with large degreesIntersecting families, cross-intersecting families, and a proof of a conjecture of Feghali, Johnson and ThomasOn cross \(t\)-intersecting families of setsA structure theorem for almost low-degree functions on the sliceThe maximum size of intersecting and union families of setsShadows and shiftingMaximum hitting of a set by compressed intersecting familiesOn the size of shadow-added intersecting familiesGeometric influences. II: Correlation inequalities and noise sensitivityMultiply-intersecting familiesA sharp bound for the product of weights of cross-intersecting familiesNew injective proofs of the Erdős-Ko-Rado and Hilton-Milner theoremsConstrained versions of Sauer's LemmaOn families of sets without \(k\) pairwise disjoint membersCross-intersecting pairs of hypergraphsA structural result for 3-graphsOn the maximum number of edges in a hypergraph with given matching numberA generalization of Erdős' matching conjectureA product version of the Erdős-Ko-Rado theoremCross-intersecting families of permutationsMultiple cross-intersecting families of signed setsRandom walks and multiply intersecting familiesOn non-trivial families without a perfect matchingOn the structure of minimal winning coalitions in simple voting gamesBeyond the Erdős matching conjectureOld and new applications of Katona's circleMinimum degree and diversity in intersecting antichainsOn the \(d\)-cluster generalization of Erdős-Ko-RadoInvitation to intersection problems for finite setsOn the arithmetic mean of the size of cross-union familiesThe influence of variables in product spacesStrongly intersecting integer partitionsMaximum hitting for \(n\) sufficiently largeTight bounds for Katona's shadow intersection theoremOn strengthenings of the intersecting shadow theoremClassification of maximum hittings by large familiesMatchings and covers in hypergraphsA Kruskal-Katona type result and applicationsFamilies of finite sets satisfying intersection restrictionsOn \(t\)-intersecting families of signed sets and permutationsTwo problems on matchings in set families -- in the footsteps of Erdős and KleitmanA short proof of Talbot's theorem for intersecting separated setsVC dimension and a union theorem for set systemsA generalization of Fisher's inequalityCross-intersecting sub-families of hereditary familiesAK-type stability theorems on cross \(t\)-intersecting familiesMaximum degree and diversity in intersecting hypergraphsThe Erdős-Ko-Rado properties of various graphs containing singletonsThe Erdős-Ko-Rado properties of set systems defined by double partitionsOn the size of the product of overlapping familiesTurán problems for vertex-disjoint cliques in multi-partite hypergraphsOn the rainbow matching conjecture for 3-uniform hypergraphsA discrete isodiametric result: the Erdős-Ko-Rado theorem for multisetsThe Hilton-Spencer cycle theorems via Katona's shadow intersection theoremTransversal numbers for hypergraphs arising in geometryWeighted 3-wise 2-intersecting familiesThe exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families




This page was built for publication: