相关论文: Chord theorems on graphs
We extend the closed graph theorem and the open mapping theorem to a context in which a natural duality interchanges their extensions.
The gonality sequence $(\gamma_r)_{r\geq1}$ of a finite graph / metric graph / algebraic curve comprises the minimal degrees $\gamma_r$ of linear systems of rank $r$. For the complete graph $K_d$, we show that $\gamma_r = kd - h$ if…
The paper deals with some spectral properties of (mostly infinite) quantum and combinatorial graphs. Quantum graphs have been intensively studied lately due to their numerous applications to mesoscopic physics, nanotechnology, optics, and…
A graph $G$ admits an $H$-tiling if it contains a collection of vertex-disjoint copies of $H$. In this paper, we confirm a conjecture proposed by K\"{u}hn, Osthus, and Treglown by showing that for any given graph $H$, there exists a…
Chord diagrams and related enlacement graphs of alternating knots are enhanced to obtain complete invariant graphs including chirality detection. Moreover, the equivalence by common enlacement graph is specified and the neighborhood graph…
As is well known, a graph is a mathematical object modeling the existence of a certain relation between pairs of elements of a given set. Therefore, it is not surprising that many of the first results concerning graphs made reference to…
Let $G$ be a tripartite graph with $N$ vertices in each vertex class. If each vertex is adjacent to at least $(2/3)N$ vertices in each of the other classes, then either $G$ contains a subgraph that consists of $N$ vertex-disjoint triangles…
A graph G is called (2k, k)-connected if G is 2k-edge-connected and G-v is k-edge-connected for every vertex v. The study of (2k, k)-connected graphs is motivated by a conjecture of Frank which states that a graph has a 2-vertex-connected…
The Torelli theorem establishes that the Jacobian of a smooth projective curve, together with the polarization provided by the theta divisor, fully characterizes the curve. In the case of nodal curves, there exists a concept known as fine…
A graph is chordal if it does not contain an induced cycle of length greater than three. We determine the minimum size of a chordal graph with given order and minimum degree. In doing so, we have discovered interesting properties of chordal…
The Chord distributed hash table (DHT) is well-known and frequently used to implement peer-to-peer systems. Chord peers find other peers, and access their data, through a ring-shaped pointer structure in a large identifier space. Despite…
Given a thin torus $T_K$ around a knot $K\subset \mathbb{R}^3$, we construct Morse models of cord algebra $Cord(T_K)$ with $\mathbb{Z}$ and loop space coefficients. Using the Multiple time scale dynamics we identify $Cord(T_K; \mathbb{Z})$…
A graph is closed when its vertices have a labeling by [n] with a certain property first discovered in the study of binomial edge ideals. In this article, we prove that a connected graph has a closed labeling if and only if it is chordal,…
In a directed graph, a kernel is a subset of vertices that is both stable and absorbing. Not all digraphs have a kernel, but a theorem due to Boros and Gurvich guarantees the existence of a kernel in every clique-acyclic orientation of a…
Let $(X,d)$ be a nonempty metric space and let $n\in \mathbb N^+$. We shall say that $T\colon X\to X$ is a graphic contraction of order $n$ if there exists $\alpha\in (0,1)$ such that the inequality $$ d(T^n x,T^{2n}x) \leqslant \alpha…
We introduce a notion of curvature on finite, combinatorial graphs. It can be easily computed by solving a linear system of equations. We show that graphs with curvature bounded below by $K>0$ have diameter bounded by $\mbox{diam}(G) \leq…
A simple graph G is k-ordered (respectively, k-ordered hamiltonian) if, for any sequence of k distinct vertices v_1, ..., v_k of G, there exists a cycle (respectively, a hamiltonian cycle) in G containing these k vertices in the specified…
We introduce several notions and give examples. We prove that ${\rm Stab}(D^b(K(l)))\cong {\mathbb C}\times \mathcal H$ for $l\geq 3$, where $K(l)$ is $l$-Kronecker quiver. This is an example of SOD, where ${\rm Stab}( \langle \mathcal…
In this paper, we study the componentwise linearity of edge ideals of weighted oriented graphs. We show that if $D$ is a weighted oriented graph whose edge ideal $I(D)$ is componentwise linear, then the underlying simple graph $G$ of $D$ is…
We prove that for every integer $k\geq 1$, there exists a connected graph $H_k$ such that $v(H_k)=reg(H_k)+k$, where $v(G)$ and $reg(G)$ denote the $v$-number and the (Castelnuovo-Mumford) regularity of a graph $G$ respectively.