相关论文: Analyse harmonique sur le graphe de Pascal

In 1962, Erd\H{o}s proved a theorem on the existence of Hamilton cycles in graphs with given minimum degree and number of edges. Significantly strengthening in case of balanced bipartite graphs, Moon and Moser proved a corresponding theorem…

Carmesin has extended Robertson and Seymour's tree-of-tangles theorem to the infinite tangles of locally finite infinite graphs. We extend it further to the infinite tangles of all infinite graphs. Our result has a number of applications…

We demonstrate that the proper homotopy equivalence relation for locally finite graphs is Borel complete. Furthermore, among the infinite graphs, there is a comeager equivalence class. As corollaries, we obtain the analogous results for the…

We study the Liouville type theorems for transversally harmonic and biharmonic maps on foliated Riemannian manifolds

A basic fact in spectral graph theory is that the number of connected components in an undirected graph is equal to the multiplicity of the eigenvalue zero in the Laplacian matrix of the graph. In particular, the graph is disconnected if…

Let X(G) denote the flag complex of a graph G=(V,E) on n vertices. We study relations between the first eigenvalues of successive higher Laplacians of X(G). One consequence is the following result: Let \lambda_2(G) denote the second…

We consider harmonic maps on simply connected Riemann surfaces into the group $\mathrm{U}(n)$ of unitary matrices of order $n$. It is known that a harmonic map with an associated algebraic extended solution can be deformed into a new…

Using topological circles in the Freudenthal compactification of a graph as infinite cycles, we extend to locally finite graphs a result of Oberly and Sumner on the Hamiltonicity of finite graphs. This answers a question of Stein, and gives…

It is shown that if T is a connected nontrivial graph and X is an arbitrary finite simplicial complex, then there is a graph G such that the complex Hom(T,G) is homotopy equivalent to X. The proof is constructive, and uses a nerve lemma.…

The goal of this paper is to show that there exists a simple, yet universal statistical logic of spectral graph analysis by recasting it into a nonparametric function estimation problem. The prescribed viewpoint appears to be good enough to…

We find all polyhedral graphs such that their complements are still polyhedral. These turn out to be all self-complementary.

In this manuscript we study rotationally $p$-harmonic maps between spheres. We prove that for $p\in\mathbb{N}$ given, there exist infinitely many $p$-harmonic self-maps of $\mathbb{S}^m$ for each $m\in\mathbb{N}$ with $p<m< 2+p+2\sqrt{p}$.…

The theory of graphons has proven to be a powerful tool in many areas of graph theory. In this paper, we introduce several foundational aspects of the theory of digraphons -- asymmetric two-variable functions that arise as limits of…

We introduce an abstract framework for the study of clustering in metric graphs: after suitably metrising the space of graph partitions, we restrict Laplacians to the clusters thus arising and use their spectral gaps to define several…

Indecomposible semifinite harmonic functions on the direct product of graded graphs are classified. As a particular case, the full list of indecomposible traces for the infinite inverse symmetric semigroup is obtained.

The adjacency operator of a graph has a spectrum and a class of scalar-valued spectral measures which have been systematically analyzed; it also has a spectral multiplicity function which has been less studied. The first purpose of this…

We prove that there is an algorithm to determine if a given finite graph is an induced subgraph of a given curve graph.

We calculate the spectrum of the diagram for each finite $3$-transposition group. Such graphs with a given minimal eigenvalue have occurred in the context of compact Griess subalgebras of vertex operator algebras.

Given a graph $G$, we define a filtration of simplicial complexes associated to $G$, $\mathcal{F}_0(G)\subseteq\mathcal{F}_1(G)\subseteq\cdots\subseteq\mathcal{F}_\infty(G)$ where the first complex is the independence complex and the last…

We derive a number of upper and lower bounds for the first nontrivial eigenvalue of a finite quantum graph in terms of the edge connectivity of the graph, i.e., the minimal number of edges which need to be removed to make the graph…