English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We define a new family of graph invariants, studying the topology of themoduli space of their geometric realizations in Euclidean spaces, using alimiting procedure reminiscent of Floer homology. Given a labeled graph $G$ on$n$ vertices and $d \geq 1$, $W_{G, d} \subseteq \mathbb{R}^{d \times n}$denotes the space of nondegenerate realizations of $G$ in $\mathbb{R}^d$.Theset $W_{G, d}$ might not be connected, even when it is nonempty, and we referto its connected components as rigid isotopy classes of $G$ in $\mathbb{R}^d$.We study the topology of these rigid isotopy classes. First, regarding theconnectivity of $W_{G, d}$, we generalize a result of Maehara that $W_{G, d}$is nonempty for $d \geq n$ to show that $W_{G, d}$ is $k$-connected for $d \geqn + k + 1$, and so $W_{G, \infty}$ is always contractible. While $\pi_k(W_{G,d}) = 0$ for $G$, $k$ fixed and $d$ large enough, we also prove that, in spiteof this, when $d\to \infty$ the structure of the nonvanishing homology of$W_{G, d}$ exhibits a stabilization phenomenon: it consists of $(n-1)$ equallyspaced clusters whose shape does not depend on $d$, for $d$ large enough. Thisleads to the definition of a family of graph invariants, capturing thisstructure. For instance, the sum of the Betti numbers of $W_{G,d}$ does notdepend on $d$, for $d$ large enough; we call this number the Floer number ofthe graph $G$. Finally, we give asymptotic estimates on the number of rigidisotopy classes of $\mathbb{R}^d$--geometric graphs on $n$ vertices for $d$fixed and $n$ tending to infinity. When $d=1$ we show that asymptotically as$n\to \infty$ each isomorphism class corresponds to a constant number of rigidisotopy classes, on average. For $d>1$ we prove a similar statement at thelogarithmic scale.

Graph invariants from the topology of rigid isotopy classes