Related papers: Proofs For Progressively Generalized Fibonacci Ide…
A graph $G$ is universal for a class of graphs $\mathcal{C}$, if, up to isomorphism, $G$ contains every graph in $\mathcal{C}$ as a subgraph. In 1978, Chung and Graham asked for the minimal number $s(n)$ of edges in a graph with $n$…
We present an elementary proof of a generalization of Kirchoff's matrix tree theorem to directed, weighted graphs. The proof is based on a specific factorization of the Laplacian matrices associated to the graphs, which only involves the…
An algebraic formalism, developped with V. Glaser and R. Stora for the study of the generalized retarded functions of quantum field theory, is used to prove a factorization theorem which provides a complete description of the generalized…
We give a common matroidal generalisation of `A Cantor-Bernstein theorem for paths in graphs' by Diestel and Thomassen and `A Cantor-Bernstein-type theorem for spanning trees in infinite graphs' by ourselves.
We analyze the universality and generalization of graph neural networks (GNNs) on attributed graphs, i.e., with node attributes. To this end, we propose pseudometrics over the space of all attributed graphs that describe the fine-grained…
Courcelle's Theorem is an important result in graph theory, proving the existence of linear-time algorithms for many decision problems on graphs whose tree-width is bounded by a constant. The purpose of this text is twofold: to provide an…
In this work, we provide an upper bound for global certification of graph homomorphism, a generalization of graph coloring. In certification, the nodes of a network should decide if the network satisfies a given property, thanks to small…
Uncover the vertices of a given graph, deterministic or random, in random order; we consider both a discrete-time and a continuous-time version. We study the evolution of the number of visible edges, and show convergence after normalization…
We consider uniform random permutations drawn from a family enumerated through generating trees. We develop a new general technique to establish a central limit theorem for the number of consecutive occurrences of a fixed pattern in such…
We derive a general recurrence relation for squares of Fibonacci-like numbers. Various properties are developed, including double binomial summation identites.
Barbieri recently showed that the finite graphs realising any given finite automorphism group have unbounded genus, answering a question of Cornwell et al. In this note we give a short proof of a stronger result: they have unbounded clique…
We give a simple statistical proof of a binomial identity, by evaluating the Laplace transform of the maximum of n independent exponential random variables in two different ways. As a by product, we obtain a simple proof of an interesting…
Among the classical models for interconnection networks are hypercubes and Fibonacci cubes. Fibonacci cubes are induced subgraphs of hypercubes obtained by restricting the vertex set to those binary strings which do not contain consecutive…
In this paper, we consider infinite sums derived from the reciprocals of the generalized Fibonacci numbers. We obtain some new and interesting identities for the generalized Fibonacci numbers.
In this short survey article, we present an elementary, yet quite powerful, method of enumerating independent sets in graphs. This method was first employed more than three decades ago by Kleitman and Winston and has subsequently been used…
The study of denominator identities for Lie superalgebras was recently developed by M. Gorelik, V.G. Kac, P.Moseneder Frajria, I. Musson, P. Papi, M. Wakimoto and the author. In this paper we generalize these identities to the twisted…
We extend Edmonds' Branching Theorem to locally finite infinite digraphs. As examples of Oxley or Aharoni and Thomassen show, this cannot be done using ordinary arborescences, whose underlying graphs are trees. Instead we introduce the…
We derive an identity connecting any two second-order linear recurrence sequences having the same recurrence relation but whose initial terms may be different. Binomial and ordinary summation identities arising from the identity are…
Chung and Graham introduced a method to uniquely represent each positive integer using even-indexed Fibonacci terms. We generalize this result to represent each positive integer using other Fibonacci terms with equally-spaced indices.
This paper studies the problem of upper bounding the number of independent sets in a graph, expressed in terms of its degree distribution. For bipartite regular graphs, Kahn (2001) established a tight upper bound using an…