Related papers: A Cantor-Bernstein theorem for infinite matroids
We generalise structure tree theory, which is based on removing finitely many edges, to removing finitely many vertices. This gives a significant generalization of Tutte's tree decomposition of 2-connected graphs into 3-connected blocks.…
Based on a calibration argument, we prove a Bernstein type theorem for entire minimal graphs over Gauss space $\mathbb{G}^n$ by a simple proof.
In this paper we obtain precise asymptotics for certain families of graphs, namely circulant graphs and degenerating discrete tori. The asymptotics contain interesting constants from number theory among which some can be interpreted as…
A graph has tree-width at most $k$ if it can be obtained from a set of graphs each with at most $k+1$ vertices by a sequence of clique sums. We refine this definition by, for each non-negative integer $\theta$, defining the…
We present a simple proof for the universality of invariant and equivariant tensorized graph neural networks. Our approach considers a restricted intermediate hypothetical model named Graph Homomorphism Model to reach the universality…
We give new general formulas for the asymptotics of the number of spanning trees of a large graph. A special case answers a question of McKay (1983) for regular graphs. The general answer involves a quantity for infinite graphs that we call…
The canonical tree-decomposition theorem, given by Robertson and Seymour in their seminal graph minors series, turns out to be one of the most important tool in structural and algorithmic graph theory. In this paper, we provide the…
Using the notion of generalized divisors introduced by Hartshorne, we adapt the theory of adjoint forms to the case of Gorenstein curves. We show an infinitesimal Torelli-type theorem for vector bundles on Gorenstein curves. We also…
We prove a general Ramsey theorem for trees with a successor operation. This theorem is a common generalization of the Carlson-Simpson Theorem and the Milliken Tree Theorem for regularly branching trees. Our theorem has a number of…
Coverings of undirected graphs are used in distributed computing, and unfoldings of directed graphs in semantics of programs. We study these two notions from a graph theoretical point of view so as to highlight their similarities, as they…
We obtain the Phragm\`en-Lindel\"of principle on combinatorial infinite weighted graphs for the Cauchy problem associated to a certain class of parabolic equations with a variable density. We show that the hypothesis made on the density is…
We compute explicitly (modulo solutions of certain algebraic equations) the spectra of infinite graphs obtained by attaching one or several infinite paths to some vertices of certain finite graphs. The main result concerns a canonical form…
The famous Cantor-Bernstein-Schroder theorem (CBS-theorem for short) of set theory was generalized by Sikorski and Tarski to \sigma-complete Boolean algebras. After this, numerous generalizations of the CBS-theorem, extending the…
Cayley's formula states that there are $n^{n-2}$ spanning trees in the complete graph on $n$ vertices; it has been proved in more than a dozen different ways over its 150 year history. The complete graphs are a special case of threshold…
We give a proof for sharp estimate for the number of spanning trees using linear algebra and generalize this bound to multigraphs. In addition, we show that this bound is tight for complete graphs. In addition, we give estimates for number…
We prove that Fomin's generalization of Lindstr\"om's lemma for paths on acyclic directed graphs to walks on general directed graphs also generalizes a theorem of Stembridge in the same way. Moreover, we show that whenever a family of…
Menger's theorem - the maximum number of vertex-disjoint $X$-$Y$ paths is equal to the minimum size of an $X$-$Y$ separator - is generally not true in bidirected graphs. We prove that Menger's theorem holds true if we take the nontrivial…
In this paper, we establish bounds for the eigenvalues of matrix polynomials. Specifically, we find different generalizations of the Enestrom-Kakeya Theorem for matrix polynomials.
It is shown that the generating function for tree graphs in the "in-in" formalism may be calculated by solving the classical equations of motion subject to certain constraints. This theorem is illustrated by application to the evolution of…
We prove `twisted' versions of Kirchhoff's network theorem and Kirchhoff's matrix-tree theorem on connected finite graphs. Twisting here refers to chains with coefficients in a flat unitary line bundle.