A bijection for the Boolean numbers of Ferrers graphs

DOI10.1007/s00373-021-02442-2zbMath1479.05161OpenAlexW4200016101MaRDI QIDQ2062895

Beáta Bényi

Publication date: 3 January 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-021-02442-2

zbMATH Keywords

complete bipartite graphspoly-Bernoulli numbersFerrers graphsBoolean number

Mathematics Subject Classification ID

Graph polynomials (05C31) Combinatorial identities, bijective combinatorics (05A19) Bernoulli and Euler numbers and polynomials (11B68) Permutations, words, matrices (05A05) Coloring of graphs and hypergraphs (05C15)

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Homology of the Boolean complex
• Homotopy type of the Boolean complex of a Coxeter system.
• Complexes of injective words and their commutation classes
• EW-tableaux, Le-tableaux, tree-like tableaux and the abelian sandpile model
• Enumerative properties of Ferrers graphs
• The combinatorics of the bar resolution in group cohomology
• Lonesum and \(\Gamma\)-free \(0-1\) fillings of Ferrers shapes
• Alternation acyclic tournaments
• Acyclic orientations of graphs. (Reprint)
• Boolean complexes for Ferrers graphs
• On the Interpretation of Whitney Numbers Through Arrangements of Hyperplanes, Zonotopes, Non-Radon Partitions, and Orientations of Graphs
• The on-line encyclopedia of integer sequences
• Combinatorial properties of poly-Bernoulli relatives

This page was built for publication: A bijection for the Boolean numbers of Ferrers graphs