Related papers: The topological complexity of pure graph braid gro…

We prove a topological rigidity result for simple, thick, hyperbolic P-manifolds of dimension 2: isomorphism of the fundamental groups implies homeomorphism of the P-manifolds. An immediate application is a diagram rigidity theorem for…

For random graphs, the containment problem considers the probability that a binomial random graph $G(n,p)$ contains a given graph as a substructure. When asking for the graph as a topological minor, i.e., for a copy of a subdivision of the…

A graph with convex quadratic stability number is a graph for which the stability number is determined by solving a convex quadratic program. Since the very beginning, where a convex quadratic programming upper bound on the stability number…

We investigate topological, combinatorial, statistical, and enumeration properties of finite graphs with high Kolmogorov complexity (almost all graphs) using the novel incompressibility method. Example results are: (i) the mean and variance…

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…

In this paper the class of Brauer graph algebras is proved to be closed under derived equivalence. For that we use the rank of the maximal torus of the identity component $Out^0(A)$ of the group of outer automorphisms of a symmetric stably…

We generalize the idea of cofinite groups, due to B. Hartley. First we define cofinite spaces in general. Then, as a special situation, we study cofinite graphs and their uniform completions. The idea of constructing a cofinite graph starts…

In this paper, we extend and refine previous Tur\'an-type results on graphs with a given circumference. Let $W_{n,k,c}$ be the graph obtained from a clique $K_{c-k+1}$ by adding $n-(c-k+1)$ isolated vertices each joined to the same $k$…

A class of topological spaces is topologically rigid if any two spaces with the same fundamental group are also homeomorphic. Topological rigidity, in addition to its intrinsic interest, has been useful for solving abstract commensurability…

We give a sufficient condition on totally disconnected topological graphs such that their associated topological graph algebras are purely infinite.

We study the complexity of reasoning in abstracts argumentation frameworks close to graph classes that allow for efficient reasoning methods, i.e.\ to one of the classes of acyclic, noeven, biparite and symmetric AFs. In this work we show…

We show the maximality of subfields as cliques in a special family of Cayley graphs defined on the additive group of a finite field. In particular, this confirms a conjecture of Yip on generalized Paley graphs.

We study the properties of finite graphs in which the ball of radius $r$ around each vertex induces a graph isomorphic to some fixed graph $F$. This is a natural extension of the study of regular graphs, and of the study of graphs of…

We prove that for any toric ideal of a graph the degree of any element of Graver basis is bounded above by an exponential function of the maximal degree of a circuit.

Let $\mathcal{P}_G$ be the family of all topologically mixing, but not exact self-maps of a topological graph $G$. It is proved that the infimum of topological entropies of maps from $\mathcal{P}_G$ is bounded from below by $(\log 3/…

This work establishes rigorous, novel and widely applicable stability guarantees and transferability bounds for graph convolutional networks -- without reference to any underlying limit object or statistical distribution. Crucially,…

Let $V$ be a finite dimensional complex vector space and $W\subset \GL(V)$ be a finite complex reflection group. Let $V^{\reg}$ be the complement in $V$ of the reflecting hyperplanes. A classical conjecture predicts that $V^{\reg}$ is a…

We prove that closed manifolds admitting a generic metric whose sectional curvature is locally quasi-constant are graphs of space forms. In the more general setting of QC spaces where sets of isotropic points are arbitrary, under suitable…

Series-parallel network topologies generally exhibit simplified dynamical behavior and avoid high combinatorial complexity. A comprehensive analysis of how flow complexity emerges with a graph's deviation from series-parallel topology is…

A graph $X$ is said to be unstable if the direct product $X\times K_2$ (also called the canonical double cover of $X$) has automorphisms that do not come from automorphisms of its factors $X$ and $K_2$. It is non-trivially unstable if it is…