Cliques and independent subgroups of the Birkhoff polytope graph

TL;DR

This paper investigates the combinatorial structure of the Birkhoff polytope graph, focusing on its cliques and independent subgroups, and establishes bounds and a new Erdős-Ko-Rado-type theorem for permutations.

Contribution

It provides bounds for the clique number of the Birkhoff polytope graph and proves a novel Erdős-Ko-Rado-type theorem for permutations involving 3-cycles.

Findings

Established bounds for the clique number of the graph.

Identified maximal subgroups within the graph.

Proved an Erdős-Ko-Rado-type theorem for permutations.

Abstract

The Birkhoff polytope $\Omega_n$ is the polytope of doubly stochastic matrices of order $n$. The Birkhoff polytope graph $G(\Omega_n)$ is the skeleton of $\Omega_n$; it is the Cayley graph whose vertex set consists of the elements of the symmetric group ${\rm Sym}(n)$ of degree $n$, where two permutations are adjacent if one equals the product of the other with a cycle. We study the combinatorial structure of this graph, focusing on its maximal and maximum cliques and on its independent subgroups (subgroups of ${\rm Sym}(n)$ whose elements are pairwise nonadjacent in the graph). We obtain maximal subgroups of $G(\Omega_n)$ and establish both a lower bound and an upper bound for its clique number. Especially, we prove that if $K$ is a subset of ${\rm Sym}(n)$ consisting of 3-cycle permutations such that $\delta_1^{-1}\delta_2$ is a single cycle for all $\delta_1,\delta_2\in K$, then the maximum size of $K$ is $\lfloor (n-1)^2/4\rfloor$, which can be viewed as an Erd\H{o}s-Ko-Rado-type theorem for ${\rm Sym}(n)$.