Stability for intersecting families in \(\mathrm{PGL}(2,q)\)
From MaRDI portal
Publication:907232
zbMath1330.05168MaRDI QIDQ907232
Publication date: 25 January 2016
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i4p41
Combinatorial aspects of representation theory (05E10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Extremal set theory (05D05) Group actions on combinatorial structures (05E18)
Related Items (3)
Unnamed Item ⋮ Characterization of intersecting families of maximum size in \(\mathrm{PSL}(2,q)\) ⋮ On the intersection density of primitive groups of degree a product of two odd primes
Cites Work
- A quasi-stability result for dictatorships in \(S_n\)
- Stability for \(t\)-intersecting families of permutations
- An Erdős-Ko-Rado theorem for the derangement graph of PGL(\(2,q\)) acting on the projective line
- The exact bound in the Erdős-Ko-Rado theorem
- A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations
- Erdős-Ko-Rado theorem with conditions on the maximal degree
- Spectra of Cayley graphs
- On the maximum number of permutations with given maximal or minimal distance
- Graph products, Fourier analysis and spectral techniques
- Stable sets of maximal size in Kneser-type graphs
- Boolean functions whose Fourier transform is concentrated on the first two levels.
- Triangle-intersecting families of graphs
- Fourier analysis and large independent sets in powers of complete graphs
- A proof of the Cameron-Ku conjecture
- Complex Representations of 𝐺𝐿(2,𝐾) for Finite Fields 𝐾
- Generating a random permutation with random transpositions
- On the Shannon capacity of a graph
- A stability result for balanced dictatorships in Sn
- Intersecting families of permutations
This page was built for publication: Stability for intersecting families in \(\mathrm{PGL}(2,q)\)
