Enumerative problems for arborescences and monotone paths on polytope graphs

DOI10.1002/jgt.22725zbMath1522.05152arXiv2002.00999OpenAlexW3188887930MaRDI QIDQ6056794

Zhenyang Zhang, Jesús A. De Loera, Christos A. Athanasiadis

Publication date: 4 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

polytopesextremal combinatoricsdirected graphsarborescencemonotone path

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

The Polyhedral Geometry of Pivot Rules and Monotone Paths

Cites Work

• Unnamed Item
• Unnamed Item
• On the generalized lower bound conjecture for polytopes and spheres
• Rigidity and the lower bound theorem. I
• A homotopy theorem on oriented matroids
• On the shadow simplex method for curved polyhedra
• Fiber polytopes
• Piles of cubes, monotone path polytopes, and hyperplane arrangements
• Convex and linear orientations of polytopal graphs
• Triangulations of simplicial polytopes
• Fiber polytopes and fractional power series
• Fiber polytopes for the projections between cyclic polytopes
• Zonotopes whose cellular strings are all coherent
• The diameter of associahedra
• A proof of the lower bound conjecture for convex polytopes
• The asymptotic diameter of cyclohedra
• Diameter of graphs of reduced words and galleries
• Cellular Strings on Polytopes
• Lectures on Polytopes
• Monotone Paths on Zonotopes and Oriented Matroids
• LP-orientations of cubes and crosspolytopes
• Oriented Matroids
• On the Length of Monotone Paths in Polyhedra

This page was built for publication: Enumerative problems for arborescences and monotone paths on polytope graphs