We investigate the behavior of arboricity under two fundamental graph operations, namely wedges and joins, proving an exact formula for wedges and establishing general upper and lower bounds for joins. Using the characterization of the simplicial geometric category of connected graphs in terms of arboricity, we derive a wedge formula for simplicial geometric category and obtain corresponding estimates for graph joins. Finally, we illustrate these results through explicit computations for several classes of graphs by constructing forest decompositions and the associated covers by strongly collapsible subcomplexes.
We show that every lattice weak Minkowski summand of a smooth polytope combinatorially isomorphic to a product of simplices has a quadratic triangulation. This is achieved by identifying this class of polytopes with the class of Nakajima polytopes. We combine these results to give a new proof that two lattice weak Mink...
Juliana Curtis, Tuong Le, Chayim Lowen· 0 citations
Consider a random geometric graph with vertices given by a Poisson point process, and whose edges depend on independent marks corresponding to the vertices and pairs of vertices. In this paper, we study two related questions on this general model: the number of edge crossings in a projection of this graph, and its grap...
We endow spaces of decorated planar rooted trees with new dendriform and tridendrifrom algebra structures and provide their combinatorial description. We then show that the planar counterparts of Arborified Zeta Values are algebra morphisms for these shuffle and quasi-shuffle products of planar rooted trees. We also pr...
P. Catoire, Pierre Clavier, Ku-Yu Fan· 0 citations
In this article, we generalize the notion of connected subgraph arrangements, established by Cuntz and K\"uhne by allowing edges of cardinality greater than two, with a focus on local properties. We show that the class of free connected hypersubgraph arrangements is larger than the class of free connected subgraph arra...
We recall definitions of linking numbers and Wu--Simon numbers for spatial graphs. We expose a `converse'to the Conway--Gordon--Sachs theorem (i.e. description of linking functions for embeddings $K_6\to\mathbb{R}^3$), and some results on Wu--Simon numbers. We conjecture and discuss a generalization of the Conway--Gord...
A metric graph is of pseudocompact type if identifying parallel edges produces a tree. We give a constructive proof that, for such graphs, divisorial $d$-gonality is equivalent to the existence of a degree $d$ harmonic morphism to a tree. This mirrors the algebraic correspondence, for curves of compact type, between li...
Benjamin Mascuch, M. Bigas· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
