Related papers: Kirszbraun extension on connected finite graph
The fibre theorem \cite{schm2003} for the moment problem on closed semi-algebraic subsets of $\R^d$ is generalized to finitely generated real unital algebras. A charaterization of moment functionals on the polynomial algebra…
We develop a new approach of extension calculus in the category of strict polynomial functors, based on Troesch complexes. We obtain new short elementary proofs of numerous classical Ext-computations as well as new results. In particular,…
We calculate an unrefined limit of the superconformal index (the Schur-like index) of the Klebanov-Witten theory from the dual AdS side by using the recently developed giant graviton expansion method. Our formula includes multiple sums of…
Stark and Terras introduced the edge zeta function of a finite graph in 1996. The edge zeta function is the reciprocal of a polynomial in twice as many variables as edges in the graph and can be computed in polynomial time. We look at graph…
Kirchhoff's Matrix-Tree Theorem asserts that the number of spanning trees in a finite graph can be computed from the determinant of any of its reduced Laplacian matrices. In many cases, even for well-studied families of graphs, this can be…
We give a new proof of the theorem of Boesch-Tindell and Farzad-Mahdian-Mahmoodian-Saberi-Sadri that a directed graph extends to a strongly connected digraph on the same vertex set if and only if it has no complete directed cut. Our proof…
The new graph parameter twin-width, introduced by Bonnet, Kim, Thomass e and Watrigant in 2020, allows for an FPT algorithm for testing all FO properties of graphs. This makes classes of efficiently bounded twin-width attractive from the…
The $\{K_2,C_n\}$-factor of a graph is a spanning subgraph whose each component is either $K_2$ or $C_n$. In this paper, a sufficient condition with regard to tight toughness, isolated toughness and binding number bounds to guarantee the…
We present a method using contour integration to derive definite integrals and their associated infinite sums which can be expressed as a special function. We give a proof of the basic equation and some examples of the method. The advantage…
In this paper, we establish a theorem on extension of Lipschitz maps $f$ definable in Hensel minimal fields $K$. This may be regarded as a definable, non-Archimedean, non-locally compact version of Kirszbraun's extension theorem. We proceed…
We consider the \emph{$k$-edge connected spanning subgraph} (kECSS) problem, where we are given an undirected graph $G = (V, E)$ with nonnegative edge costs $\{c_e\}_{e\in E}$, and we seek a minimum-cost \emph{$k$-edge connected} subgraph…
In this paper we prove the sharpness of connectivity bounds established in [15]. The proof depends on some facts in the theory of univalent polynomials. We also discuss applications to the equation $r(z)=\bar z$ where $r$ is a rational…
We obtain several sharp spectral bounds, approximations, and exact values for the isoperimetric number and related edge-expansion parameters of graphs. Our results focus on graph powers and on families of graphs with rich algebraic or…
The total effective resistance, also called the Kirchhoff index, provides a robustness measure for a graph $G$. We consider two optimization problems of adding $k$ new edges to $G$ such that the resulting graph has minimal total effective…
In previous paper I construct an approximative solution of the power series expansion in closed forms of Grand Confluent Hypergeometric (GCH) function only up to one term of A_n's [4]. And I obtain normalized constant and orthogonal…
In this work we obtain sharp embedding inequalities for a family of conformally invariant integral extension operators. This family includes among others the classical Poisson extension operator and the extension operator with Riesz kernel.…
(DRAFT VERSION) In this article we present a proof of the famous Kirchoff's Matrix-Tree theorem, which relates the number of spanning trees in a connected graph with the cofactors (and eigenvalues) of its combinatorial Laplacian matrix.…
A $k$-truss is an edge-induced subgraph $H$ such that each of its edges belongs to at least $k-2$ triangles of $H$. This notion has been introduced around ten years ago in social network analysis and security, as a form of cohesive subgraph…
By complexity of a finite graph we mean the number of spanning trees in the graph. The aim of the present paper is to give a new approach for counting complexity $\tau(n)$ of cyclic $n$-fold coverings of a graph. We give an explicit…
Boesch and Chen (SIAM J. Appl. Math., 1978) introduced the cut-version of the generalized edge-connectivity, named $k$-edge-connectivity. For any integer $k$ with $2\leq k\leq n$, the {\em $k$-edge-connectivity} of a graph $G$, denoted by…