相关论文: Reflective Graphs, Ollivier curvature, effective d…

We characterize the absolute retracts in the category of reflexive oriented graphs, that is, antisymmetric reflexive graphs, where morphisms between objects preserve arcs (which may be sent to loops). Here we show, by correcting a much…

A graph $G$ is called self-ordered (a.k.a asymmetric) if the identity permutation is its only automorphism. Equivalently, there is a unique isomorphism from $G$ to any graph that is isomorphic to $G$. We say that $G=(V,E)$ is robustly…

A graph G is said to be 1-perfectly orientable (1-p.o. for short) if it admits an orientation such that the out-neighborhood of every vertex is a clique in G. The class of 1-p.o. graphs forms a common generalization of the classes of…

We prove that certain classes of metrically homogeneous graphs omitting triangles of odd short perimeter as well as triangles of long perimeter have the extension property for partial automorphisms and we describe their Ramsey expansions.

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…

Using Schauder's theory for linear elliptic partial differential equations in two independent variables and fundamental estimates for univalent mappings due to E. Heinz we establish an upper bound of the Gaussian curvature of…

In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency…

Characterizing derived equivalences between algebras via combinatorial structures has recently become a popular topic. In this paper, we study admissible fractional Brauer graph algebras, a new subclass of self-injective special biserial…

Using representation theory techniques we prove that various spaces of derivations or one-sided multipliers over certain operator algebras are reflexive. A sample result: any bounded local derivation (local left multiplier) on an…

We present a method for associating labeled directed graphs to finite-dimensional Lie algebras, thereby enabling rapid identification of key structural algebraic features. To formalize this approach, we introduce the concept of…

Discrete curvatures are quantities associated to the nodes and edges of a graph that reflect the local geometry around them. These curvatures have a rich mathematical theory and they have recently found success as a tool to analyze networks…

A graph on $n$ vertices is said to be \emph{$C$-Ramsey} if every clique or independent set of the graph has size at most $C \log n$. The only known constructions of Ramsey graphs are probabilistic in nature, and it is generally believed…

Given a finite, simple, connected graph $G=(V,E)$ with $|V|=n$, we consider the associated graph Laplacian matrix $L = D - A$ with eigenvalues $0 = \lambda_1 < \lambda_2 \leq \dots \leq \lambda_n$. One can also consider the same graph…

We introduce a curvature function for planar graphs to study the connection between the curvature and the geometric and spectral properties of the graph. We show that non-positive curvature implies that the graph is infinite and locally…

Let $G$ be a connected bridgeless graph with domination number $\gamma$. The oriented diameter (strong diameter) of $G$ is the smallest integer $d$ for which $G$ admits a strong orientation with diameter (strong diameter) $d$. Kurz and…

An old problem raised independently by Jacobson and Sch\"onheim asks to determine the maximum $s$ for which every graph with $m$ edges contains a pair of edge-disjoint isomorphic subgraphs with $s$ edges. In this paper we determine this…

Motivated by recent results in graph C*-algebras concerning an equivariant pushout structure of the Vaksman-Soibelman quantum odd spheres, we introduce a class of graphs called trimmable. Then we show that the Leavitt path algebra of a…

In this paper, we study the large-scale structure of dense regular graphs. This involves the notion of robust expansion, a recent concept which has already been used successfully to settle several longstanding problems. Roughly speaking, a…

A few properties of unitary Cayley graphs are explored using their eigenvalues. It is shown that the adjacency algebra of a unitary Cayley graph is a coherent algebra. Finally, a class of unitary Cayley graphs that are distance regular are…

The study of very large graphs is a prominent theme in modern-day mathematics. In this paper we develop a rigorous foundation for studying the space of finite labelled graphs and their limits. These limiting objects are naturally countable…