A graph theory of rook placements (Q2236816)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A graph theory of rook placements
scientific article

    Statements

    A graph theory of rook placements (English)
    0 references
    0 references
    26 October 2021
    0 references
    Summary: Two boards are rook equivalent if they have the same number of non-attacking rook placements for any number of rooks. Define a rook equivalence graph on an equivalence class of Ferrers boards by specifying that two boards are connected by an edge if you can obtain one of the boards by moving squares in the other board out of one column and into a single other column. Given such a graph, we characterize which boards will yield connected graphs. We also provide some cases where common graphs will or will not be the graph for some set of rook equivalent Ferrers boards. Finally, we extend this graph definition to the \(m\)-level rook placement generalization developed by \textit{K. S. Briggs} and \textit{J. B. Remmel} [J. Comb. Theory, Ser. A 113, No. 6, 1138--1171 (2006; Zbl 1096.05007)]. This yields a graph on the set of rook equivalent singleton boards, and we characterize which singleton boards give rise to a connected graph.
    0 references
    rook equivalence graph
    0 references
    rook equivalent singleton boards
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references