English
Related papers

Related papers: Combinatorial modifications of Reeb graphs and the…

200 papers

In this article, we investigate some relations between dynamical and algebraic properties of semigroups of entire maps with applications to semigroups of formal series. We show that two entire maps fixing the origin share the set of…

Dynamical Systems · Mathematics 2024-08-12 C. Cabrera , P. Dominguez , P. Makienko

We investigate topological realizations of higher-rank graphs. We show that the fundamental group of a higher-rank graph coincides with the fundamental group of its topological realization. We also show that topological realization of…

Combinatorics · Mathematics 2012-05-15 S. Kaliszewski , Alex Kumjian , John Quigg , Aidan Sims

The MEG (minimum equivalent graph) problem is, given a directed graph, to find a small subset of the edges that maintains all reachability relations between nodes. The problem is NP-hard. This paper gives a proof that, for graphs where each…

Data Structures and Algorithms · Computer Science 2015-06-02 Samir Khuller , Balaji Raghavachari , Neal Young

We prove that a random graph $G(n,p)$, with $p$ above the Hamiltonicity threshold, is typically such that for any $r$-colouring of its edges there exists a Hamilton cycle with at least $(2/(r+ 1)-o(1))n$ edges of the same colour. This…

Combinatorics · Mathematics 2021-04-22 Lior Gishboliner , Michael Krivelevich , Peleg Michaeli

Let $S$ be a nonorientable surface of genus $g\ge 5$ with $n\ge 0$ punctures, and $\Mcg(S)$ its mapping class group. We define the complexity of $S$ to be the maximum rank of a free abelian subgroup of $\Mcg(S)$. Suppose that $S_1$ and…

Geometric Topology · Mathematics 2017-01-03 Ferihe Atalan , Błażej Szepietowski

Let $ \text{Mod}(S_g)$ denote the mapping class group of the closed orientable surface $S_g$ of genus $g\geq 2$, and let $f\in \text{Mod}(S_g)$ be of finite order. We give an inductive procedure to construct an explicit hyperbolic structure…

Geometric Topology · Mathematics 2017-10-24 Shiv Parsad , Kashyap Rajeevsarathy , Bidyut Sanki

We introduce the Hermitian-invariant group $\Gamma_f$ of a proper rational map $f$ between the unit ball in complex Euclidean space and a generalized ball in a space of typically higher dimension. We use properties of the groups to define…

Complex Variables · Mathematics 2017-03-29 John P. D'Angelo , Ming Xiao

We consider when automorphisms of a graph can be induced by homeomorphisms of embeddings of the graph in a $3$-manifold. In particular, we prove that every automorphism of a graph is induced by a homeomorphism of some embedding of the graph…

Geometric Topology · Mathematics 2021-12-15 Erica Flapan , Song Yu

A mixed graph $\widetilde{G}$ is obtained by orienting some edges of a graph $G$, where $G$ is the underlying graph of $\widetilde{G}$. Let $r(\widetilde{G})$ be the $H$-rank of $\widetilde{G}$. Denote by $r(G)$, $\kappa(G)$, $m(G)$ and…

Combinatorics · Mathematics 2025-07-08 Qi Wu , Yong Lu

We prove that for any $r\in \mathbb{N}$, there exists a constant $C_r$ such that the following is true. Let $\mathcal{F}=\{F_1,F_2,\dots\}$ be an infinite sequence of bipartite graphs such that $|V(F_i)|=i$ and $\Delta(F_i)\leq \Delta$ hold…

Combinatorics · Mathematics 2021-09-21 António Girão , Oliver Janzer

If $G$ is a graph and $\vec H$ is an oriented graph, we write $G\to \vec H$ to say that every orientation of the edges of $G$ contains $\vec H$ as a subdigraph. We consider the case in which $G=G(n,p)$, the binomial random graph. We…

A maniplex of rank n is a connected, n-valent, edge-coloured graph that generalises abstract polytopes and maps. If the automorphism group of a maniplex M partitions the vertex-set of M into k distinct orbits, we say that M is a k-orbit…

Combinatorics · Mathematics 2018-12-12 Daniel Pellicer , Primož Potočnik , Micael Toledo

Let $E$ be a closed polar subset of $\mathbb{C}$. In this short note, we use elementary potential theoretic tools to show that any conformal map on $\mathbb{C}\setminus{E}$ is necessarily a M\"{o}bius map. As a consequence we obtain that…

Complex Variables · Mathematics 2022-02-21 Ratna Pal , Koushik Ramachandran , Sivaguru Ravisankar

It is well-known that every vertex-transitive graph admits a representation as a coset graph. In this paper, we extend this construction by introducing monodromy graphs defined through double cosets. Our main result establishes that every…

Combinatorics · Mathematics 2025-09-23 Kai Yuan , Yan Wang

The Reeb space of a function or a map on a manifold is defined as the space of all connected components of preimages and represents the manifold compactly. In fact, Reeb spaces are fundamental and useful tools in geometric theory of…

Geometric Topology · Mathematics 2022-03-01 Naoki Kitazawa

We consider closed manifolds that possess a so called rank one ray structure. That is a (flat) affine structure such that the linear part is given by the products of a diagonal transformation and a commuting rotation. We show that closed…

Differential Geometry · Mathematics 2021-09-30 Raphaël Alexandre

The main result of the paper is motivated by the following two, apparently unrelated graph optimization problems: (A) as an extension of Edmonds' disjoint branchings theorem, characterize digraphs comprising $k$ disjoint branchings $B_i$…

Combinatorics · Mathematics 2017-09-05 Kristóf Bérczi , András Frank

In this paper we study the following problem. Let $A$ be a fixed graph, and let $\hom(G,A)$ denote the number of homomorphisms from a graph $G$ to $A$. Furthermore, let $v(G)$ denote the number of vertices of $G$, and let $\mathcal{G}_d$…

Combinatorics · Mathematics 2017-05-08 Péter Csikvári

The Hilbert function of standard graded algebras are well understood by Macaulay's theorem and very little is known in the local case, even if we assume that the local ring is a complete intersection. An extension to the power series ring…

Commutative Algebra · Mathematics 2012-05-25 J. Elias , M. E. Rossi , G. Valla

A metric graph is a geometric realization of a finite graph by identifying each edge with a real interval. A divisor on a metric graph $\Gamma$ is an element of the free abelian group on $\Gamma$. The rank of a divisor on a metric graph is…

Combinatorics · Mathematics 2013-05-01 Ye Luo
‹ Prev 1 3 4 5 6 7 10 Next ›