An Erdös-Ko-Rado theorem for direct products
From MaRDI portal
Publication:2563525
DOI10.1006/eujc.1996.0063zbMath0860.05068OpenAlexW2024496534MaRDI QIDQ2563525
Publication date: 21 April 1997
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/eujc.1996.0063
Related Items (21)
Structure of independent sets in direct products of some vertex-transitive graphs ⋮ Intersecting families in \(\begin{pmatrix}[m\\ \ell\end{pmatrix}\cup\begin{pmatrix}[n]\\ k\end{pmatrix}\)] ⋮ Intersection theorems under dimension constraints ⋮ Intersecting \(k\)-uniform families containing a given family ⋮ Size and structure of large \((s,t)\)-union intersecting families ⋮ Extremal \(t\)-intersecting families for direct products ⋮ On the maximum number of edges in hypergraphs with fixed matching and clique number ⋮ Intersecting \(k\)-uniform families containing all the \(k\)-subsets of a given set ⋮ A degree version of the Hilton-Milner theorem ⋮ Extremal Problem for Matchings and Rainbow Matchings on Direct Products ⋮ Independent sets in direct products of vertex-transitive graphs ⋮ Representations of signed graphs ⋮ Intersecting Families in Symmetric Unions of Direct Products of Set Families ⋮ Non-trivially intersecting multi-part families ⋮ Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees ⋮ Independent sets in tensor products of three vertex-transitive graphs ⋮ Primitivity and independent sets in direct products of vertex-transitive graphs ⋮ Intractability of approximate multi-dimensional nonlinear optimization on independence systems ⋮ Refuting conjectures in extremal combinatorics via linear programming ⋮ Extremal \(G\)-free induced subgraphs of Kneser graphs ⋮ A general 2-part Erdȍs-Ko-Rado theorem
This page was built for publication: An Erdös-Ko-Rado theorem for direct products
