Counting shellings of complete bipartite graphs and trees

DOI10.1007/s10801-020-00965-0OpenAlexW2893216752MaRDI QIDQ2045057

Junyao Peng, Yibo Gao

Publication date: 11 August 2021

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

Full work available at URL: https://arxiv.org/abs/1809.10263

zbMATH Keywords

treescomplete bipartite graphsshelling

Mathematics Subject Classification ID

Algebraic combinatorics (05Exx) Enumerative combinatorics (05Axx) Ordered sets (06Axx)

Related Items (1)

Successive vertex orderings of fully regular graphs

Uses Software

• MathOverflow

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• q-hook length formulas for forests
• Separable elements and splittings of Weyl groups
• Separable elements in Weyl groups
• A multivariate ``inv hook formula for forests
• Generalized Quotients in Coxeter Groups
• Combinatorial algebraic topology

This page was built for publication: Counting shellings of complete bipartite graphs and trees