Related papers: P_k and C_k structure and substructure connectivit…

The connection and eventual integration of High-Performance Computing (HPC) with Quantum Computing (QC) represents a transformative advancement in computational technology, promising significant enhancements in solving complex, previously…

In this short note we study two questions about the existence of subgraphs of the hypercube $Q_n$ with certain properties. The first question, due to Erd\H{o}s--Hamburger--Pippert--Weakley, asks whether there exists a bounded degree…

We present a new, novel approach to obtaining a network's connectivity. More specifically, we show that there exists a relationship between a network's graph isoperimetric properties and its conditional connectivity. A network's…

The power graph $\mathcal{P}(G)$ of a given finite group $G$ is the simple undirected graph whose vertices are the elements of $G$, in which two distinct vertices are adjacent if and only if one of them can be obtained as an integral power…

The generalized connectivity of a graph $G$ was introduced by Chartrand et al. Let $S$ be a nonempty set of vertices of $G$, and $\kappa(S)$ be defined as the largest number of internally disjoint trees $T_1, T_2, \cdots, T_k$ connecting…

Let $k$ be an algebraically closed field of characteristic $p > 0$. We show that if $X\subseteq\mathbb{P}^n_k$ is an equidimensional subscheme with Hilbert--Kunz multiplicity less than $\lambda$ at all points $x\in X$, then for a general…

Let $G$ be a nontrivial connected graph of order $n$, and $k$ an integer with $2\leq k\leq n$. For a set $S$ of $k$ vertices of $G$, let $\kappa (S)$ denote the maximum number $\ell$ of edge-disjoint trees $T_1,T_2,...,T_\ell$ in $G$ such…

The generalized $k$-connectivity of a graph $G$, denoted by $\kappa_k(G)$, is the minimum number of internally edge disjoint $S$-trees for any $S\subseteq V(G)$ and $|S|=k$. The generalized $k$-connectivity is a natural extension of the…

For an integer $\ell\geqslant 2$, the $\ell$-component connectivity of a graph $G$, denoted by $\kappa_{\ell}(G)$, is the minimum number of vertices whose removal from $G$ results in a disconnected graph with at least $\ell$ components or a…

We prove that: I. If $L$ is a $T_1$ space, $|L|>1$ and $d(L) \leq \kappa \geq \omega$, then there is a submaximal dense subspace $X$ of $L^{2^\kappa}$ such that $|X|=\Delta(X)=\kappa$; II. If $\frak{c}\leq\kappa=\kappa^\omega<\lambda$ and…

Networks with higher-order interactions, prevalent in biological, social, and information systems, are naturally represented as hypergraphs, yet their structural complexity poses fundamental challenges for geometric characterization. While…

We study algorithmic and structural aspects of connectivity in hypergraphs. Given a hypergraph $H=(V,E)$ with $n = |V|$, $m = |E|$ and $p = \sum_{e \in E} |e|$ the best known algorithm to compute a global minimum cut in $H$ runs in time…

A standard approach to reduce the complexity of very large networks is to group together sets of nodes into clusters according to some criterion which reflects certain structural properties of the network. Beyond the well-known modularity…

Recently, studies exemplified by Hyper-Connections (HC) have extended the ubiquitous residual connection paradigm established over the past decade by expanding the residual stream width and diversifying connectivity patterns. While yielding…

First we consider families in the hypercube $Q_n$ with bounded VC dimension. Frankl raised the problem of estimating the number $m(n,k)$ of maximal families of VC dimension $k$. Alon, Moran and Yehudayoff showed that…

Interconnection networks provide an effective mechanism for exchanging data between processors in a parallel computing system. One of the most efficient interconnection networks is the hypercube due to its structural regularity, potential…

The topology of an interconnection network can be modeled by a graph $G=(V(G),E(G))$. The connectivity of graph $G$ is a parameter to measure the reliability of corresponding network. Direct product is one important graph product. This…

Connectivity and diagnosability are two important parameters for the fault tolerant of an interconnection network $G$. In 1996, F\`{a}brega and Fiol proposed the $g$-extra connectivity of $G$. A subset of vertices $S$ is said to be a…

Photonic computing promises ultrafast and energy-efficient artificial intelligence. However, existing photonic neural networks (PNNs) remain functionally shallow and difficult to scale. Here we establish a theory-guided framework showing…

Understanding physics of high-$T_c$ cuprate superconductors remains one of the important problems in materials science. Though a number of diverse theories argue about the superconductivity and competing orders, ab initio and quantitative…