相关论文: On the stabilization of the topological complexity…

The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling with $d$ labels that is preserved only by a trivial automorphism. The distinguishing stability, of a graph $G$ is denoted by…

Albertson has defined the irregularity of a simple undirected graph $G=(V,E)$ as $ \irr(G) = \sum_{uv\in E}|d_G(u)-d_G(v)|,$ where $d_G(u)$ denotes the degree of a vertex $u \in V$. Recently, this graph invariant gained interest in the…

In this paper we study the the average order of dominating sets in a graph, $\operatorname{avd}(G)$. Like other average graph parameters, the extremal graphs are of interest. Beaton and Brown (2021) conjectured that for all graphs $G$ of…

The notion of bounded expansion captures uniform sparsity of graph classes and renders various algorithmic problems that are hard in general tractable. In particular, the model-checking problem for first-order logic is fixed-parameter…

We provide an algorithm for calculating the unramified Brauer group of a homogeneous space $X$ of a semi-simple simply connected group $H$ with finite geometric stabiliser over any field of characteristic 0. When $k$ is a number field, we…

Let G be a finite graph with the non-k-order property (essentially, a uniform finite bound on the size of an induced sub-half-graph). A major result of the paper applies model-theoretic arguments to obtain a stronger version of…

A scramble on a connected multigraph is a collection of connected subgraphs that generalizes the notion of a bramble. The maximum order of a scramble, called the scramble number of a graph, was recently developed as a tool for lower…

Let M be an open, connected manifold. A classical theorem of McDuff and Segal states that the sequence of configuration spaces of n unordered, distinct points in M is homologically stable with coefficients in Z: in each degree, the integral…

We prove new lower and upper bounds on the higher gonalities of finite graphs. These bounds are generalizations of known upper and lower bounds for first gonality to higher gonalities, including upper bounds on gonality involving…

We study the graphs formed from instances of the stable matching problem by connecting pairs of elements with an edge when there exists a stable matching in which they are matched. Our results include the NP-completeness of recognizing…

Structurally stable (rough) flows on surfaces have only finitely many singularities and finitely many closed orbits, all of which are hyperbolic, and they have no trajectories joining saddle points. The violation of the last property leads…

A graph class $\mathscr{C}$ is called monadically stable if one cannot interpret, in first-order logic, arbitrary large linear orders in colored graphs from $\mathscr{C}$. We prove that the model checking problem for first-order logic is…

In this article we show that the braid type of a set of $1$-periodic orbits of a non-degenerate Hamiltonian diffeomorphism on a surface is stable under perturbations which are sufficiently small with respect to the Hofer metric $d_{\rm…

A graph is said to be globally rigid if almost all embeddings of the graph's vertices in the Euclidean plane will define a system of edge-length equations with a unique (up to isometry) solution. In 2007, Jackson, Servatius and Servatius…

We develop a stability theory for contractive local IFSs on compact metric spaces. Unlike the classical global setting, local systems may exhibit a richer symbolic and geometric structure, including code spaces that are not of finite type…

It is well-known that a minimal graph of codimension one is stable, i.e. the second variation of the area functional is non-negative. This is no longer true for higher codimensional minimal graphs. In this note, we prove that a minimal…

In 1995, Brouwer proved that the toughness of a connected $k$-regular graph $G$ is at least $k/\lambda-2$, where $\lambda$ is the maximum absolute value of the non-trivial eigenvalues of $G$. Brouwer conjectured that one can improve this…

We introduce and study the sequential analogue of Grant's parametrized topological complexity of group epimorphisms, which generalizes the sequential topological complexity of groups. We derive bounds for sequential parametrized topological…

We prove the tightest-known upper bounds on the sample complexity of multi-group learning. Our algorithm extends the one-inclusion graph prediction strategy using a generalization of bipartite $b$-matching. In the group-realizable setting,…

The aim of this paper is to present a few versions of the Riemann-Hurwitz formula for a regular branched covering of graphs. By a graph, we mean a finite connected multigraph. The genus of a graph is defined as the rank of the first…