A proof of the Cameron-Ku conjecture
From MaRDI portal
Publication:3115842
DOI10.1112/jlms/jdr035zbMath1235.05003arXiv0807.3118OpenAlexW3101206403WikidataQ122964302 ScholiaQ122964302MaRDI QIDQ3115842
Publication date: 11 February 2012
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0807.3118
Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Extremal set theory (05D05)
Related Items (17)
Stability for \(t\)-intersecting families of permutations ⋮ Structure and supersaturation for intersecting families ⋮ The spectrum of eigenvalues for certain subgraphs of the \(k\)-point fixing graph ⋮ The smallest eigenvalues of the 1-point fixing graph ⋮ Stability for intersecting families in \(\mathrm{PGL}(2,q)\) ⋮ Theorems of Erdős-Ko-Rado type in geometrical settings ⋮ Forbidding just one intersection, for permutations ⋮ On cross Parsons numbers ⋮ The chromatic number of the \(q\)-Kneser graph for large \(q\) ⋮ LOW-DEGREE BOOLEAN FUNCTIONS ON , WITH AN APPLICATION TO ISOPERIMETRY ⋮ Stability for 1-intersecting families of perfect matchings ⋮ Characterization of intersecting families of maximum size in \(\mathrm{PSL}(2,q)\) ⋮ A quasi-stability result for dictatorships in \(S_n\) ⋮ The Erdős-Ko-Rado theorem for the derangement graph of the projective general linear group acting on the projective space ⋮ The maximum sum and the maximum product of sizes of cross-intersecting families ⋮ Largest independent sets of certain regular subgraphs of the derangement graph ⋮ On the partition associated to the smallest eigenvalues of the \(k\)-point fixing graph
This page was built for publication: A proof of the Cameron-Ku conjecture
