Graph Stirling numbers
Combinatorics, Graph theory
The graph Stirling numbers are a unifying construct that counts the ways to cover all simplices of a complete graph with larger simplices.
Graph Stirling numbers
Concept for Discrete Mathematics (2023)
Concept for Discrete Mathematics (2023)