A note on “Largest independent sets of certain regular subgraphs of the derangement graph”

DOI10.1007/S10801-024-01304-3MaRDI QIDQ6491166

Yuval Filmus, Nathan Lindzey

Publication date: 24 April 2024

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10) Representations of finite symmetric groups (20C30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Extremal set theory (05D05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Symmetric groups (20B30)

Cites Work

• Unnamed Item
• Largest independent sets of certain regular subgraphs of the derangement graph
• A new proof for the Erdős-Ko-Rado theorem for the alternating group
• Intersecting families of permutations

This page was built for publication: A note on “Largest independent sets of certain regular subgraphs of the derangement graph”