We propose a notion of graph convergence that interpolates between the Benjamini–
Schramm convergence of bounded degree graphs and the dense graph convergence …

We present formulae for computing the Yamada polynomial of spatial graphs obtained by
replacing edges of plane graphs, such as cycle-graphs, theta-graphs, and bouquet-graphs …

We recall the construction and survey the properties of the Yamada polynomial of spatial
graphs and present formulas for the Yamada polynomial of some classes of graphs. Then …

In this note, we show how to obtain a “characteristic power series” of graphons–infinite limits
of dense graphs–as the limit of normalized reciprocal characteristic polynomials. This leads …

In this note, we show how to obtain a" characteristic power series" of graphons--infinite limits
of dense graphs--as the limit of normalized reciprocal characteristic polynomials. This leads …

Хорошо известно, что (лорановские) полиномы играют важную роль в теории узлов
(см., например,[12]). Достаточно напомнить полиномы Александера и Джонса, которые …

In this paper, we survey some recent developments on statistical properties of matchings of
very large and infinite graphs. We discuss extremal graph theoretic results like Schrijver's …