2009/08/05 by Andrew Graham Fenn, Andrew G. Fenn, Fenn, Andrew G.
Computer Science · Mathematics · #Advanced Graph Theory Research #Cellular Automata and Applications #Combinatorics (math.CO) #FOS: Mathematics #math.CO
paper · pdf · doi:10.48550/arxiv.0908.0605
15 pages
arxiv created 2009/08/05 · openalex publication_date 2009/08/05 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We examine the family of nestohedra resulting from the complete bipartite graph through the medium of a generating function and demonstrate some of their combinatorial invariants.