Bounds on the Diameter of Graph Associahedra

06/30/2021
by   Jean Cardinal, et al.
0

Graph associahedra are generalized permutohedra arising as special cases of nestohedra and hypergraphic polytopes. The graph associahedron of a graph G encodes the combinatorics of search trees on G, defined recursively by a root r together with search trees on each of the connected components of G-r. In particular, the skeleton of the graph associahedron is the rotation graph of those search trees. We investigate the diameter of graph associahedra as a function of some graph parameters. It is known that the diameter of the associahedra of paths of length n, the classical associahedra, is 2n-6 for a large enough n. We give a tight bound of Θ(m) on the diameter of trivially perfect graph associahedra on m edges. We consider the maximum diameter of associahedra of graphs on n vertices and of given tree-depth, treewidth, or pathwidth, and give lower and upper bounds as a function of these parameters. Finally, we prove that the maximum diameter of associahedra of graphs of pathwidth two is Θ (nlog n).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/25/2021

The diameter of caterpillar associahedra

The caterpillar associahedron 𝒜(G) is a polytope arising from the rotati...
research
03/30/2018

On the Diameter of Tree Associahedra

We consider a natural notion of search trees on graphs, which we show is...
research
08/08/2018

Bounds for the diameter of the weight polytope

A weighted game or a threshold function in general admits different weig...
research
01/28/2021

A Spectral Approach to Polytope Diameter

We prove upper bounds on the graph diameters of polytopes in two setting...
research
03/07/2022

Geodetic convexity and Kneser graphs

The Kneser graph K(2n+k,n), for positive integers n and k, is the graph ...
research
06/12/2020

On Packing Low-Diameter Spanning Trees

Edge connectivity of a graph is one of the most fundamental graph-theore...
research
04/03/2023

Counting the minimum number of arcs in an oriented graph having weak diameter 2

An oriented graph has weak diameter at most d if every non-adjacent pair...

Please sign up or login with your details

Forgot password? Click here to reset