Related papers: Leaper Embeddings
In the m-\emph{Eternal Domination} game, a team of guard tokens initially occupies a dominating set on a graph $G$. An attacker then picks a vertex without a guard on it and attacks it. The guards defend against the attack: one of them has…
The deduction game is a variation of the game of cops and robber on graphs in which searchers must capture an invisible evader in at most one move. Searchers know each others' initial locations, but can only communicate if they are on the…
Given b>0, integers n, m=bn and a probability measure Q on {0, 1,..., m}, consider the random intersection graph on the vertex set [n]={1, ..., n}, where i and j are declared adjacent whenever S(i) and S(j) intersect. Here S(1), ..., S(n)…
The ladder graph plays an important role in many applications as Electronics, Electrical and Wireless communication areas. The aim of this work is to present a new class of odd graceful labeling for the ladder graph. In particular, we show…
The $n$-Queens' graph, $\mathcal{Q}(n)$, is the graph associated to the $n \times n$ chessboard (a generalization of the classical $8 \times 8$ chessboard), with $n^2$ vertices, each one corresponding to a square of the chessboard. Two…
The exploitation of graph structures is the key to effectively learning representations of nodes that preserve useful information in graphs. A remarkable property of graph is that a latent hierarchical grouping of nodes exists in a global…
Large-scale multi-relational embedding refers to the task of learning the latent representations for entities and relations in large knowledge graphs. An effective and scalable solution for this problem is crucial for the true success of…
We show that if a non-degenerate PL map $f:N\to M$ lifts to a topological embedding in $M\times\mathbb R^k$ then it lifts to a PL embedding in there. We also show that if a stable smooth map $N^n\to M^m$, $m\ge n$, lifts to a topological…
Recent works on representation learning for Knowledge Graphs have moved beyond the problem of link prediction, to answering queries of an arbitrary structure. Existing methods are based on ad-hoc mechanisms that require training with a…
The statistics of meanders is studied in connection with the Temperley-Lieb algebra. Each (multi-component) meander corresponds to a pair of reduced elements of the algebra. The assignment of a weight $q$ per connected component of meander…
We revisit the classical question of the relationship between the diameter of a graph and its expansion properties. One direction is well understood: expander graphs exhibit essentially the lowest possible diameter. We focus on the reverse…
We prove that a connected planar graph with $n$ vertices and $n+\mu$ edges has a vertex separator of size $O( \sqrt{\mu} + 1)$, and this separator can be computed in linear time.
For Hardy spaces and weighted Bergman spaces on the open unit ball in ${\mathbb C}^n$, we determine exactly when $A^p_\alpha\subset H^q$ or $H^p\subset A^q_\alpha$, where $0<q<\infty$, $0<p<\infty$, and $-\infty<\alpha<\infty$. For each…
In a seminal paper on finding large matchings in sparse random graphs, Karp and Sipser proposed two algorithms for this task. The second algorithm has been intensely studied, but due to technical difficulties, the first algorithm has…
As a fundamental problem in pattern recognition, graph matching has applications in a variety of fields, from computer vision to computational biology. In graph matching, patterns are modeled as graphs and pattern recognition amounts to…
The index of a signed graph is the largest eigenvalue of its adjacency matrix. For positive integers $n$ and $m\le n^2/4$, we determine the maximal index of complete signed graphs with $n$ vertices and $m$ negative edges. This settles (the…
Le n be any positive integer. A hyperbinary expansion of n is are presentation of n as sum of powers of 2, each power being used at most twice. In this paper we study some properties of a suitable edge-coloured and vertex-weighted oriented…
We show that for each d>0 the d-dimensional Hamming graph H(d,q) has an orientably regular surface embedding if and only if q is a prime power p^e. If q>2 there are up to isomorphism \phi(q-1)/e such maps, all constructed as Cayley maps for…
The blow-up lemma states that a system of super-regular pairs contains all bounded degree spanning graphs as subgraphs that embed into a corresponding system of complete pairs. This lemma has far-reaching applications in extremal…
For $S \subseteq \mathbb{R}$, positive integer $n$, and $d > 0$, let $G(S^n, d)$ be the graph whose vertex set is $S^n$ where any two vertices are adjacent if and only if they are Euclidean distance $d$ apart. The primary question we will…