相关论文: Chern classes of graph hypersurfaces and deletion-…
A \emph{locally irregular graph} is a graph whose adjacent vertices have distinct degrees. We say that a graph $G$ can be decomposed into $k$ locally irregular subgraphs if its edge set may be partitioned into $k$ subsets each of which…
The mesh matrix $Mesh(G,T_0)$ of a connected finite graph $G=(V(G),E(G))=(vertices, edges) \ of \ G$ of with respect to a choice of a spanning tree $T_0 \subset G$ is defined and studied. It was introduced by Trent \cite{Trent1,Trent2}. Its…
A previously proposed two-step algorithm for calculating the expectation values of Chern-Simons graphs fails to determine certain crucial signs. The step which involves calculating tetrahedra by solving certain non- linear equations is…
In high-energy particle collisions, the primary collision products usually decay further resulting in tree-like, hierarchical structures with a priori unknown multiplicity. At the stable-particle level all decay products of a collision form…
A well-known theorem of Vizing states that if $G$ is a simple graph with maximum degree $\Delta$, then the chromatic index $\chi'(G)$ of $G$ is $\Delta$ or $\Delta+1$. A graph $G$ is class 1 if $\chi'(G)=\Delta$, and class 2 if…
Two-component fermionic superfluids on a lattice with an external non-Abelian gauge field give access to a variety of topological phases in presence of a sufficiently large spin imbalance. We address here the important issue of…
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seymour and Thomas proved a decomposition theorem for Berge…
A classical result of Nosal asserts that every $m$-edge graph with spectral radius $\lambda (G)> \sqrt{m}$ contains a triangle. A celebrated extension of Nikiforov [35] states that if $G$ is an $m$-edge graph with $\lambda (G)> \sqrt{(1-…
The combination of words ``discrete curvature'' is only an apparent contradiction. In this survey we describe curvature notions associated with polygons, polyhedral surfaces, and with abstract polyhedral manifolds. Several theorems about…
The \emph{thinness} of a graph is a width parameter that generalizes some properties of interval graphs, which are exactly the graphs of thinness one. Graphs with thinness at most two include, for example, bipartite convex graphs. Many…
We prove that for smooth projective threefolds whose anticanonical divisors are nef, the second Chern classes are pseudo-effective under a weak assumption. As an application, the pseudo-effectivity of the second Chern classes implies that…
Confirming a conjecture posed by Caro, it was shown by Chen and Yu that every graph $G$ with $n$ vertices and at most $2n-4$ edges has a stable cutset, which is a stable set of vertices whose removal disconnects the graph. Le and Pfender…
We study rank 2 torus-equivariant torsion-free sheaves on the complex projective space. For reflexive sheaves we derive a simple formula for the Chern polynomial, and in the general torsion-free case we introduce an iterative construction…
We study the additivity of various geometric invariants involved in Reimann-Roch type formulas and defined via the trace map. To do so in a general context we prove that given any Grothendieck category A, the derived category D(A) has a…
The processes of constructing some graphs from others using binary operations of union with intersection (gluing) are studied. For graph classes closed with respect to gluing operations the elemental and operational bases are introduced.…
Zeon algebras have proven to be useful for enumerating structures in graphs, such as paths, trails, cycles, matchings, cliques, and independent sets. In contrast to an ordinary graph, in which each edge connects exactly two vertices, an…
The Chern character maps are one of the most important working tools in mathematics. Although they admit numerous different constructions, they are not yet fully understood at the conceptual level. In this note we eliminate this gap by…
In this paper we describe all rotation $H$-hypersurfaces in $H^n \times R$ and use them as barriers to prove existence and characterization of certain vertical $H$-graphs and to give symmetry and uniqueness results for compact…
We establish a new criterion for a bigraph to have a subgraph with prescribed degree conditions. We show that the bigraph $G[X,Y]$ has a spanning subgraph $F$ such that $g(x)\leq deg_F(x) \leq f(x)$ for $x\in X$ and $deg_F(y) \leq f(y)$ for…
Cellular sheaves equip graphs with a "geometrical" structure by assigning vector spaces and linear maps to nodes and edges. Graph Neural Networks (GNNs) implicitly assume a graph with a trivial underlying sheaf. This choice is reflected in…