Image for the paper "Graph Stirling numbers"
Image for the paper "Graph Stirling numbers"
Image for the paper "Graph Stirling numbers"
Image for the paper "Graph Stirling numbers"
Image for the paper "Graph Stirling numbers"
Image for the paper "Graph Stirling numbers"
Image for the paper "Graph Stirling numbers"
Image for the paper "Graph Stirling numbers"
Image for the paper "Graph Stirling numbers"
Image for the paper "Graph Stirling numbers"
Image for the paper "Graph Stirling numbers"
Image for the paper "Graph Stirling numbers"
Image for the paper "Graph Stirling numbers"
Image for the paper "Graph Stirling numbers"
Image for the paper "Graph Stirling numbers"
Image for the paper "Graph Stirling numbers"

Graph Stirling numbers

Combinatorics

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

ConceptNaN

T. Fink

ConceptNaN

T. Fink