English
Related papers

Related papers: Local structures in polyhedral maps on surfaces, a…

200 papers

The interaction between local traits and global frameworks of mathematical objects has long endured as a central theme in various mathematical domains. A graph \(G\) is referred to as locally linear provided that the subgraph induced by the…

Combinatorics · Mathematics 2026-04-16 Feng Liu , Leilei Zhang

In this paper we prove Schur's conjecture in $\mathbb R^d$, which states that any diameter graph $G$ in the Euclidean space $\mathbb R^d$ on $n$ vertices may have at most $n$ cliques of size $d$. We obtain an analogous statement for…

Metric Geometry · Mathematics 2017-12-01 Andrey B. Kupavskii , Alexandr Polyanskii

The bondage number $b(G)$ of a graph $G$ is the smallest number of edges whose removal from $G$ results in a graph with larger domination number. An orientable surface $\mathbb{S}_h$ of genus $h$, $h \geq 0$, is obtained from the sphere…

Combinatorics · Mathematics 2013-05-27 Vladimir Samodivkin

We prove that for any parameter r an r-locally 2-connected graph G embeds r-locally planarly in a surface if and only if a certain matroid associated to the graph G is co-graphic. This extends Whitney's abstract planar duality theorem from…

Combinatorics · Mathematics 2020-11-20 Johannes Carmesin

A simple topological graph T = (V(T), E(T)) is a drawing of a graph in the plane where every two edges have at most one common point (an endpoint or a crossing) and no three edges pass through a single crossing. Topological graphs G and H…

Combinatorics · Mathematics 2022-12-13 Jan Kynčl

A graph is $1$-planar if it has a drawing in the plane such that each edge is crossed at most once by another edge. Moreover, if this drawing has the additional property that for each crossing of two edges the end vertices of these edges…

Combinatorics · Mathematics 2020-01-27 Igor Fabrici , Jochen Harant , Tomáš Madaras , Samuel Mohr , Roman Soták , Carol T. Zamfirescu

We enumerate the singular algebraic curves in a complete linear system on a smooth projective surface. The system must be suitably ample in a rather precise sense. The curves may have up to eight nodes, or a triple point of a given type and…

Algebraic Geometry · Mathematics 2007-05-23 Steven Kleiman , Ragni Piene

In this paper, we establish Chern number identities on compact complex surfaces. As an application, we prove that if $(M,g)$ is a compact Riemannian four-manifold with constant scalar curvature and admits a compatible complex structure $J$…

Differential Geometry · Mathematics 2025-08-18 Xiaokui Yang

An embedding of a graph on an orientable surface is orientably-regular (or rotary, in an equivalent terminology) if the group of orientation-preserving automorphisms of the embedding is transitive (and hence regular) on incident vertex-edge…

Combinatorics · Mathematics 2023-11-17 Stefan Gyurki , Sona Pavlikova , Jozef Siran

A map is \emph{vertex-reversing} if it admits an arc-transitive automorphism group with dihedral vertex stabilizers. This paper classifies solvable vertex-reversing maps whose edge number and Euler characteristic are coprime. The…

Group Theory · Mathematics 2025-12-17 Cai Heng Li , Luyi Liu , Hanyue Yi

A graph $G$ is $1$-extendible if every edge belongs to at least one $1$-factor of $G$. Let $G$ be a graph with a $1$-factor $F$. Then an even $F$-orientation of $G$ is an orientation in which each $F$-alternating cycle has exactly an even…

Combinatorics · Mathematics 2024-03-20 M. Abreu , D. Labbate , F. Romaniello , J. Sheehan

We prove two mixed versions of the Discrete Nodal Theorem of Davies et. al. [3] for bounded degree graphs, and for three-connected graphs of fixed genus $g$. Using this we can show that for a three-connected graph satisfying a certain…

Combinatorics · Mathematics 2015-12-02 Yong Lin , Gabor Lippner , Dan Mangoubi , Shing-Tung Yau

A graph $G$ is geodetic if between any two vertices there exists a unique shortest path. In 1962 Ore raised the challenge to characterize geodetic graphs, but despite many attempts, such characterization still seems well beyond reach. We…

Combinatorics · Mathematics 2023-04-04 Asaf Etgar , Nati Linial

We analyze some local properties of sparse Erdos-Renyi graphs, where $d(n)/n$ is the edge probability. In particular we study the behavior of very short paths. For $d(n)=n^{o(1)}$ we show that $G(n,d(n)/n)$ has asymptotically almost surely…

Discrete Mathematics · Computer Science 2018-01-26 Jan Dreier , Philipp Kuinke , Ba Le Xuan , Peter Rossmanith

We study three mixing properties of a graph: large algebraic connectivity, large Cheeger constant (isoperimetric number) and large spectral gap from 1 for the second largest eigenvalue of the transition probability matrix of the random walk…

Combinatorics · Mathematics 2013-12-17 Mikhail Isaev , K. V Isaeva

In this paper, we investigate a family of graphs associated to collections of arcs on surfaces. These {\it multiarc graphs} naturally interpolate between arc graphs and flip graphs, both well studied objects in low dimensional geometry and…

Geometric Topology · Mathematics 2019-03-01 Hugo Parlier , Ashley Weber

Rotary maps (orientably regular maps) are highly symmetric graph embeddings on orientable surfaces. This paper classifies all rotary maps whose underlying graphs are Praeger-Xu graphs, denoted $\operatorname{C}(p,r,s)$, for any odd prime…

Combinatorics · Mathematics 2025-07-03 Zhaochen Ding , Zheng Guo , Luyi Liu

In this paper, we present a constructive and proof-relevant development of graph theory, including the notion of maps, their faces, and maps of graphs embedded in the sphere, in homotopy type theory. This allows us to provide an elementary…

Logic in Computer Science · Computer Science 2024-11-20 Jonathan Prieto-Cubides , Håkon Robbestad Gylterud

A map is a connected topological graph cellularly embedded in a surface and a complete map is a cellularly embedded complete graph in a surface. In this paper, all automorphisms of complete maps of order n are determined by permutations on…

General Mathematics · Mathematics 2009-09-29 Linfan Mao , Yanpei Liu , Feng Tian

Lott-Sturm-Villani theory of curvature on geodesic spaces has been extended to discrete graph spaces by C. L{\'e}onard by replacing W2-Wasserstein geodesics by Schr{\"o}odinger bridges in the definition of entropic curvature [23, 25, 24].…

Probability · Mathematics 2022-10-06 Paul-Marie Samson
‹ Prev 1 3 4 5 6 7 10 Next ›