Fetching the paper…
Reading the bibliography…
A set of permutations $I \subset S_n$ is said to be {\em k-intersecting} if any two permutations in $I$ agree on at least $k$ points.
Three observations on linear algebra
G. Birkhoff · 1946
Earlier work this paper cites.
The Hook graphs of S n S_{n}
J. S. Frame, G. B. Robinson, and R. M. Thrall · 1954
Earlier work this paper cites.
Some intersection theorems for systems of finite sets
A.J.W. Hilton and E.C. Milner · 1967
Earlier work this paper cites.
On eigenvalues and colorings of graphs
A. J. Hoffman · 1969
Earlier work this paper cites.
Character Theory of Finite Groups
I. Martin Isaacs · 1976
Earlier work this paper cites.
On the maximum number of permutations with given maximal or minimal distance
Peter Frankl and Mikhail Deza · 1977
Earlier work this paper cites.
Spectra of cayley graphs
László Babai · 1979
Earlier work this paper cites.
Generating a random permutation with random transpositions
Persi Diaconis and Mehrdad Shahshahani · 1981
Earlier work this paper cites.
An Introduction to Inequalities
G.H. Hardy, J.E. Littlewood, and G. Pólya · 1988
Earlier work this paper cites.
The influence of variables on Boolean functions (extended abstract)
Jeff Kahn, Gil Kalai, and Nathan Linial · 1988
Cited alongside, same era.
Lower bounds on the dimensions of irreducible representations of symmetric groups and of the exponents of the exponential of varieties of Lie algebras
S. P. Mishchenko · 1996
Cited alongside, same era.
Upper bound on the characters of the symmetric groups
Yuval Roichman · 1996
Cited alongside, same era.
The complete intersection theorem for systems of finite sets
Rudolf Ahlswede and Levon H. Khachatrian · 1997
Cited alongside, same era.
Boolean functions with low average sensitivity depend on few coordinates
Ehud Friedgut · 1998
Cited alongside, same era.
Boolean functions whose Fourier transform is concentrated on the first two levels and neutral social choice
Ehud Friedgut, Gil Kalai, and Assaf Naor · 2002
Later among the works it cites.
Intersecting families of permutations
Peter J. Cameron and C. Y. Ku · 2003
Later among the works it cites.
Stable sets of maximal size in Kneser-type graphs
Benoit Larose and Claudia Malvenuto · 2004
Later among the works it cites.
Open Problems Session, British Combinatorial Conference, 2005
Imre Leader · 2005
Later among the works it cites.
Understanding and Using Linear Programming
Jiří Matoušek and Bernd Gärtner · 2007
Later among the works it cites.
On the spectrum of the derangement graph
Paul Renteln · 2007
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Audrey Terras · 1999
Cited alongside, same era.
Scalable secure storage when half the system is faulty
Noga Alon, Haim Kaplan, Mchael Krivelevich, Dalia Malkhi, and Julien Stern · 2000
Cited alongside, same era.
The Symmetric Group: Representations, Combinatorial Algorithms, and Symmetric Functions
Bruce E. Sagan · 2001
Cited alongside, same era.
On the distribution of the Fourier spectrum of Boolean functions
Jean Bourgain · 2002
Cited alongside, same era.
Stability for t
David Ellis
Cited in the paper.
A comment on Intersecting Families of Permutations, preprint, arXiv:1706.10146
Yuval Filmus
Cited in the paper.
Traité des Substitutions et des Equations Algébriques
C. Jordan
Cited in the paper.
Intersecting families of permutations: An algebraic approach
Ehud Friedgut and Haran Pilpel · 2008
Later among the works it cites.
A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations
Chris Godsil and Karen Meagher · 2009
Later among the works it cites.