Related papers: Graphons and the $H$-property

We generalise a fundamental graph-theoretical fact, stating that every element of the cycle space of a graph is a sum of edge-disjoint cycles, to arbitrary continua. To achieve this we replace graph cycles by topological circles, and…

A graph $G$ is said to be ubiquitous, if every graph $\Gamma$ that contains arbitrarily many disjoint $G$-minors automatically contains infinitely many disjoint $G$-minors. The well-known Ubiquity conjecture of Andreae says that every…

This paper presents sufficient conditions for Hamiltonian paths and cycles in graphs. Letting $\lambda\left( G\right) $ denote the spectral radius of the adjacency matrix of a graph $G,$ the main results of the paper are: (1) Let $k\geq1,$…

It is reported that dynamical systems over digraphs have superior performance in terms of system damping and tolerance to time delays if the underlying graph Laplacian has a purely real spectrum. This paper investigates the topological…

It is well-known that a finitely generated group $\Gamma$ has Kazhdan's property (T) if and only if the Laplacian element $\Delta$ in ${\mathbb R}[\Gamma]$ has a spectral gap. In this paper, we prove that this phenomenon is witnessed in…

We study d-dimensional generalizations of three mutually related topics in graph theory: Hamiltonian paths, (unit) interval graphs, and binomial edge ideals. We provide partial high-dimensional generalizations of Ore and Posa's sufficient…

We consider families of abelian Galois coverings of the line. When the Jacobian of the general element is totally decomposable, i.e., is isogenous to a product of elliptic curves, we prove that they yield special subvarieties of $\A_g$ if…

Graph Neural Networks (GNNs), despite achieving remarkable performance across different tasks, are theoretically bounded by the 1-Weisfeiler-Lehman test, resulting in limitations in terms of graph expressivity. Even though prior works on…

Bedrossian characterized all pairs of forbidden subgraphs for a 2-connected graph to be Hamiltonian. Instead of forbidding some induced subgraphs, we relax the conditions for graphs to be Hamiltonian by restricting Ore- and Fan-type degree…

Let $H$ be an edge-weighted graph, and let $G$ be a subgraph of $H$. We say that $G$ is an $f$-fault-tolerant $t$-spanner for $H$, if the following is true for any subset $F$ of at most $f$ edges of $G$: For any two vertices $p$ and $q$,…

This paper is first-line research expanding GANs into graph topology analysis. By leveraging the hierarchical connectivity structure of a graph, we have demonstrated that generative adversarial networks (GANs) can successfully capture…

Steepness is a geometric property which, together with complex-analyticity, is needed in order to insure stability of a near-integrable hamiltonian system over exponentially long times. Following a strategy developed by Nekhoro-shev, we…

As a major step in their proof of Wagner's conjecture, Robertson and Seymour showed that every graph not containing a fixed graph $H$ as a minor has a tree-decomposition in which each torso is almost embeddable in a surface of bounded…

Let $G$ be a graph on $n$ vertices. An induced subgraph $H$ of $G$ is called heavy if there exist two nonadjacent vertices in $H$ with degree sum at least $n$ in $G$. We say that $G$ is $H$-heavy if every induced subgraph of $G$ isomorphic…

A 2-factor of a graph is a 2-regular spanning subgraph. For a graph $G$ and an independent set $I$ of $G$, let $\delta_G(I)$ denote the minimum degree of vertices contained in $I$. We show that (1) if every independent set $I$ of $G$…

Hypergraphs are useful mathematical models for describing complex relationships among members of a structured graph, while hyperdigraphs serve as a generalization that can encode asymmetric relationships in the data. However, obtaining…

We present a topological proof of the existence of invariant manifolds for maps with normally hyperbolic-like properties. The proof is conducted in the phase space of the system. In our approach we do not require that the map is a…

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…

Graphane is a two-dimensional system consisting of a single layer of fully saturated (sp$^3$ hybridization) carbon atoms. In an ideal graphane structure C-H bonds exhibit an alternating pattern (up and down with relation to the plane…

We study translation-invariant quantum spin Hamiltonians on general graphs with non-commuting interactions either given by (i) a random rank-$1$ projection or (ii) Haar projectors. For (i), we prove that the Hamiltonian is gapped on any…