Related papers: Cantor's Powerset Theorem, Graph-Theoretically
For a graph $G$, its $k$-th graph power $G^k$ is constructed by placing an edge between two vertices if they are within distance $k$. We consider the problem of deriving upper bounds on the Shannon capacity of graph powers by using spectral…
A power dominating set of a graph is a set of vertices that observes every vertex in the graph by combining classical domination with an iterative propagation process arising from electrical circuit theory. In this paper, we study the power…
We prove a spectral decomposition theorem for a well-known self-similar graph, for some finite graphs which are quotients of this graph and for a compactification of it.
By proving graph theoretical versions of Green-Stokes, Gauss-Bonnet and Poincare-Hopf, core ideas of undergraduate mathematics can be illustrated in a simple graph theoretical setting. In this pedagogical exposition we present the main…
We give yet another proof of the list-color version of Brooks' theorem that is due, independently, to Vizing and to Erd\H{o}s, Rubin and Taylor, via a famous theorem of Dirac on chordal graphs.
We develop a new approach to recurrence and the existence of non-constant harmonic functions on infinite weighted graphs. The approach is based on the capacity of subsets of metric boundaries with respect to intrinsic metrics. The main tool…
We present a short proof of Cantor's Theorem (circa 1870s): if $a_n \cos nx + b_n \sin nx \to 0$ for each $x$ in some (nonempty) open interval, where $a_n, b_n$ are sequences of complex numbers, then $a_n$ and $b_n$ converge to 0.
In this paper, we study graph-theoretic analogies of the Mertens' theorems by using basic properties of the Ihara zeta-function. One of our results is a refinement of a special case of the dynamical system Mertens' second theorem due to…
We reimplement here the recent approach of Adam Zsolt Wagner [arXiv:2104.14516], which applies reinforcement learning to construct (counter)examples in graph theory, in order to make it more readable, more stable and much faster. The…
In this paper we study some properties of Fibonacci-sum set-graphs. The aforesaid graphs are an extension of the notion of Fibonacci-sum graphs to the notion of set-graphs. The colouring of Fibonacci-sum graphs is also discussed. A number…
The Union Closed Sets Conjecture is one of the most renowned problems in combinatorics. Its appeal lies in the simplicity of its statement contrasted with the potential complexity of its resolution. The conjecture posits that, in any union…
We study the limit theory of large threshold graphs and apply this to a variety of models for random threshold graphs. The results give a nice set of examples for the emerging theory of graph limits.
We give a construction of Kirchberg algebras from graphs. By using product graphs in the construction we are able to provide models for general (UCT) Kirchberg algebras while maintaining the explicit generators and relations of the…
We provide a simple proof for the union-closed sets conjecture, a long-standing open problem in set theory with immediate applications to graph theory, number theory, and order-theory.
This work concerns results on conditions guaranteeing that certain banded $M$-matrices have banded inverses. As a first goal, a graph theoretic characterization for an off-diagonal entry of the inverse of an $M$-matrix to be positive, is…
A mathematical framework is proposed for the "big bang". It starts with some Cantor set and assumes the existence of a transformation from that set to the continuum set used in conventional physical theories like general relativity and…
This paper introduces a new graph construction, the permutational power of a graph, whose adjacency matrix is obtained by the composition of a permutation matrix with the adjacency matrix of the graph. It is shown that this construction…
In this thesis, we study connections between metric and combinatorial graphs from a Dirichlet space point of view.
Given a fixed integer $n$, we prove Ramsey-type theorems for the classes of all finite ordered $n$-colorable graphs, finite $n$-colorable graphs, finite ordered $n$-chromatic graphs, and finite $n$-chromatic graphs.
In this paper we would like to introduce some new methods for studying magic type-colorings of graphs or domination of graphs, based on combinatorial spectrum on polynomial rings. We hope that this concept will be potentially useful for the…