Related papers: Compactness and finite forcibility of graphons
Given a compact space in a fixed universe of set theory, one can naturally define its interpretation in any ZFC extension of the universe. We investigate the stability of some classes of compact spaces with respect to extensions of this…
Multi-layer graphs consist of several graphs (layers) over the same vertex set. They are motivated by real-world problems where entities (vertices) are associated via multiple types of relationships (edges in different layers). We chart the…
We prove various results connecting structural or algebraic properties of graphs and groups to conditions on their spaces of harmonic functions. In particular: we show that a group with a finitely supported symmetric measure has a…
Consider a finite dimensional (generally reducible) polynomial representation \rho of GL_n. A projective compactification of GL_n is the closure of \rho(GL_n) in the space of all operators defined up to a factor (this class of spaces can be…
Frames are the most natural generalization of orthonormal bases that allow the inclusion of redundant systems. In this article, we introduce the concept of frames generated by graphs in finite-dimensional spaces and study their properties.…
The potential of graphene for use in photonic applications was evidenced by recent demonstrations of modulators, polarisation rotators, and isolators. These promising yet preliminary results raise crucial questions: what is the optimal…
Extremal Graph Theory is a very deep and wide area of modern combinatorics. It is very fast developing, and in this long but relatively short survey we select some of those results which either we feel very important in this field or which…
We define a notion of (one-sided) edge shift spaces associated to ultragraphs. In the finite case our notion coincides with the edge shift space of a graph. In general, we show that our space is metrizable and has a countable basis of…
The recent theory of graph limits gives a powerful framework for understanding the properties of suitable (convergent) sequences $(G_n)$ of graphs in terms of a limiting object which may be represented by a symmetric function $W$ on…
Suppose G is a topological group containing a (closed) topological copy of the Frechet-Urysohn fan. If G is a perfectly normal sequential space (a normal k-space) then every closed metrizable subset in $G$ is locally compact. Applying this…
Myasnikov et al. have introduced the knapsack problem for arbitrary finitely generated groups. In previous work, the authors proved that for each graph group, the knapsack problem can be solved in $\mathsf{NP}$. Here, we determine the exact…
We investigate weak and strong structures for generalized topological spaces, among others products, sums, subspaces, quotients, and the complete lattice of generalized topologies on a given set. Also we introduce $T_{3.5}$ generalized…
Topological defects (e.g. pentagons, heptagons and pentagon-heptagon pairs) have been widely observed in large scale graphene and have been recognized to play important roles in tailoring the mechanical and physical properties of…
We define the notion of affine rigidity of a hypergraph and prove a variety of fundamental results for this notion. First, we show that affine rigidity can be determined by the rank of a specific matrix which implies that affine rigidity is…
Graphons, as limits of graph sequences, provide an operator-theoretic framework for analyzing the asymptotic behavior of graph neural operators. Spectral convergence of sampled graphs to graphons induces convergence of the corresponding…
Monatomic metal (e.g. silver) structures could form preferably at graphene edges. We explore their structural and electronic properties by performing density functional theory based first-principles calculations. The results show that…
In this paper, we study (zero) forcing sets which induce connected subgraphs of a graph. The minimum cardinality of such a set is called the connected forcing number of the graph. We provide sharp upper and lower bounds on the connected…
Graph classification plays an important role is data mining, and various methods have been developed recently for classifying graphs. In this paper, we propose a novel method for graph classification that is based on homotopy equivalence of…
A connected forcing set of a graph is a zero forcing set that induces a connected subgraph. In this paper, we introduce and study CF-dense graphs -- graphs in which every vertex belongs to some minimum connected forcing set. We identify…
With a simple generic approach, we develop a classification that encodes and measures the strength of completeness (or compactness) properties in various types of spaces and ordered structures. The approach also allows us to encode notions…