English
Related papers

Related papers: Higher connectivity of the Morse complex

200 papers

We show that every graph $G$ of maximum degree $\Delta$ and sufficiently large order has a vertex cutset $S$ of order at most $\Delta$ that induces a subgraph $G[S]$ of maximum degree at most $\Delta-3$. For $\Delta\in \{ 4,5\}$, we refine…

Combinatorics · Mathematics 2023-04-21 Stéphane Bessy , Johannes Rauch , Dieter Rautenbach , Uéverton S. Souza

A graph is strongly $\Z_{\ell}$-connected if for each boundary function $\beta: V(G)\mapsto \Z_{\ell}$ with $\beta(v) \equiv d(v) \pmod{2}$ for every vertex $v$ and $\sum_{v \in V(G)} \beta(v) \equiv 0 \pmod{2\ell}$, there exists an…

Combinatorics · Mathematics 2026-03-25 Jiaao Li , Bo Su , Zhouningxin Wang , Chunyan Wei

Fix a field $k$. When $\Delta$ is a simplicial complex on $n$ vertices with Stanley-Reisner ideal $I_\Delta$, we define and study an invariant called the $\textit{type defect}$ of $\Delta$. Except when $\Delta$ is of a single simplex, the…

Commutative Algebra · Mathematics 2019-01-30 Hailong Dao , Jay Schweig

Morse complexes and Morse-Smale complexes are topological descriptors popular in topology-based visualization. Comparing these complexes plays an important role in their applications in feature correspondences, feature tracking, symmetry…

Computational Geometry · Computer Science 2023-09-12 Mingzhe Li , Carson Storm , Austin Yang Li , Tom Needham , Bei Wang

In this paper we study the Alexander dual of a vertex decomposable simplicial complex. We define the concept of a vertex splittable ideal and show that a simplicial complex $\Delta$ is vertex decomposable if and only if $I_{\Delta^{\vee}}$…

Commutative Algebra · Mathematics 2016-08-24 Somayeh Moradi , Fahimeh Khosh-Ahang

Let \(G\) be a finite group, and let \(\Delta(G)\) denote the \emph{prime graph} built on the set of degrees of the irreducible complex characters of \(G\). It is well known that, whenever \(\Delta(G)\) is connected, the diameter of…

Group Theory · Mathematics 2016-07-19 Carlo Casolo , Silvio Dolfi , Emanuele Pacifici , Lucia Sanus

It is proved that every series-parallel digraph whose maximum vertex-degree is $\Delta$ admits an upward planar drawing with at most one bend per edge such that each edge segment has one of $\Delta$ distinct slopes. This is shown to be…

Computational Geometry · Computer Science 2016-08-31 Emilio Di Giacomo , Giuseppe Liotta , Fabrizio Montecchiani

We show that the complement of a degree $d$ hypersurface in a projective complete intersection, whose defining equations have degrees strictly larger than $d$, has a rational connectivity higher than expected. The key new feature is that a…

Algebraic Geometry · Mathematics 2010-02-05 Alexandru Dimca

Answering a question of Wright, we show that spheres of any radius are always connected in the curve graph of surfaces $\Sigma_{2,0}, \Sigma_{1,3},$ and $\Sigma_{0,6}$, and the union of two consecutive spheres is always connected for…

Geometric Topology · Mathematics 2023-09-20 Helena Heinonen , Roshan Klein-Seetharaman , Minghan Sun

We prove that the separated curve complex of a closed orientable surface of genus g is (g-3)-connected. We also obtain a connectivity property for a separated curve complex of the open surface that is obtained by removing a finite set from…

Geometric Topology · Mathematics 2012-02-09 Eduard Looijenga

A hypergraph $H$ is hamiltonian-connected if for any distinct vertices $x$ and $y$, $H$ contains a hamiltonian Berge path from $x$ to $y$. We find for all $3\leq r<n$, exact lower bounds on minimum degree $\delta(n,r)$ of an $n$-vertex…

Combinatorics · Mathematics 2023-07-17 Alexandr Kostochka , Ruth Luo , Grace McCourt

In the main part of this paper a connection is just a fiber projection onto a (not necessarily integrable) distribution or sub vector bundle of the tangent bundle. Here curvature is computed via the Froelicher-Nijenhuis bracket, and it is…

Differential Geometry · Mathematics 2016-09-06 Peter W. Michor

Let $G$ be a finite, connected graph. The eccentricity of a vertex $v$ of $G$ is the distance from $v$ to a vertex farthest from $v$. The average eccentricity of $G$ is the arithmetic mean of the eccentricities of the vertices of $G$. We…

Combinatorics · Mathematics 2020-05-01 Alex Alochukwu , Peter Dankelmann

Let $G$ be a connected graph of order $n$. The eccentricity $e(v)$ of a vertex $v$ is the distance from $v$ to a vertex farthest from $v$. The average eccentricity of $G$ is the mean of all eccentricities in $G$. We give upper bounds on the…

Combinatorics · Mathematics 2020-08-06 Fadekemi Janet Osaye

We describe a construction for embeddings of complete graphs where the dual has a cutvertex and the genus is close to the minimum genus of the primal graph. When the number of vertices is congruent to 5 modulo 12, we further guarantee that…

Combinatorics · Mathematics 2024-10-04 Timothy Sun

Bounds are proved for the connective constant \mu\ of an infinite, connected, \Delta-regular graph G. The main result is that \mu\ \ge \sqrt{\Delta-1} if G is vertex-transitive and simple. This inequality is proved subject to weaker…

Combinatorics · Mathematics 2013-05-02 Geoffrey R. Grimmett , Zhongyang Li

In this corrigendum to arXiv:2305.02973, we justify that the motivation behind Conjecture 5.1 is based on a mistaken notion. Moreover, we prove a stronger theorem that disproves the conjecture, and obtain an optimal gradient vector field on…

Combinatorics · Mathematics 2025-05-06 Anupam Mondal , Sajal Mukherjee , Kuldeep Saha

Generalized strata of meromorphic differentials are loci in the usual strata of differentials, where certain sets of residues sum up to zero. They appear naturally in the boundary of the multi-scale compactification of the usual strata.…

Algebraic Geometry · Mathematics 2024-09-25 Myeongjae Lee

Discrete Morse theory, a cell complex-analog to smooth Morse theory, has been developed over the past few decades since its original formulation by Robin Forman in 1998. In particular, discrete gradient vector fields on simplicial complexes…

Combinatorics · Mathematics 2022-07-05 Ivan Contreras , Andrew R. Tawfeek

Let $ \Phi=(G, \varphi) $ be a connected complex unit gain graph ($ \mathbb{T} $-gain graph) on a simple graph $ G $ with $ n $ vertices and maximum vertex degree $ \Delta $. The associated adjacency matrix and degree matrix are denoted by…

Combinatorics · Mathematics 2021-01-12 Aniruddha Samanta , M. Rajesh Kannan
‹ Prev 1 3 4 5 6 7 10 Next ›