Related papers: Classification of k-nets
A k-ranking of a graph G is a labeling of the vertices of G with values from 1,...,k such that any path joining two vertices with the same label contains a vertex having a higher label. The tree-depth of G is the smallest value of k for…
Let K be a knot in the 3-sphere with 2-fold branched covering space M. If for some prime p congruent to 3 mod 4 the p-torsion in the first homology of M is cyclic with odd exponent, then K is of infinite order in the knot concordance group.…
The Gruenberg-Kegel graph ${\rm GK}(G)=(V_G, E_G)$ of a finite group $G$ is a simple graph with vertex set $V_G=\pi(G)$, the set of all primes dividing the order of $G$, and such that two distinct vertices $p$ and $q$ are joined by an edge,…
We propose the notion of $k$-integration as a measure of equality of opportunity in social networks. A social network is $k$-integrated if there is a path of length at most $k$ between any two individuals, thus guaranteeing that everybody…
Represented as graphs, real networks are intricate combinations of order and disorder. Fixing some of the structural properties of network models to their values observed in real networks, many other properties appear as statistical…
The concept of k-core, which indicates the largest induced subgraph where each node has k or more neighbors, plays a significant role in measuring the cohesiveness and the engagement of a network, and it is exploited in diverse…
A Kakeya set $\mathcal{K}$ in an affine plane of order $q$ is the point set covered by a set $\mathcal{L}$ of $q+1$ pairwise non-parallel lines. Large Kakeya sets were studied by Dover and Mellinger; in [6] they showed that Kakeya sets with…
In this paper, we investigate dual 3-nets realizing the groups $C_3 \times C_3$, $C_2 \times C_4$, $\Alt_4$ and that can be embedded in a projective plane $PG(2,\mathbb K)$, where $\mathbb K$ is an algebraically closed field. We give a…
For each sequence of polynomials, P=(p_1(t),p_2(t),...), we define a characteristic series of groups, called the derived series localized at P. Given a knot K in S^3, such a sequence of polynomials arises naturally as the orders of certain…
A continuous map C^d -> C^N is a complex k-regular embedding if any k pairwise distinct points in C^d are mapped by f into k complex linearly independent vectors in C^N. Our central result on complex k-regular embeddings extends results of…
The generalized $k$-connectivity $\kappa_{k}(G)$ of a graph $G$ is a parameter that can measure the reliability of a network $G$ to connect any $k$ vertices in $G$, which is proved to be NP-complete for a general graph $G$. Let $S\subseteq…
A positive integer $n$ is said to be $k$-layered if its divisors can be partitioned into $k$ sets with equal sum. In this paper, we start the systematic study of these class of numbers. In particular, we state some algorithms to find some…
In interconnection networks, matching preclusion is a measure of robustness when there is a link failure. Let $G$ be a graph of even order. The matching preclusion number $mp(G)$ is defined as the minimum number of edges whose deletion…
A $k$-stack layout (also called a $k$-page book embedding) of a graph consists of a total order of the vertices, and a partition of the edges into $k$ sets of non-crossing edges with respect to the vertex order. The stack number (book…
Let $H$ be a set of $n$ halfplanes in $\mathbb{R}^2$ in general position, and let $k<n$ be a given parameter. We show that the number of vertices of the arrangement of $H$ that lie at depth exactly $k$ (i.e., that are contained in the…
We introduce the chain geometry $\Sigma(K,R)$ over a ring $R$ with a distinguished subfield $K$, thus extending the usual concept where $R$ has to be an algebra over $K$. A chain is uniquely determined by three of its points, if, and only…
A net in $\mathbb{P}^2$ is a configuration of lines $\mathcal A$ and points $X$ satisfying certain incidence properties. Nets appear in a variety of settings, ranging from quasigroups to combinatorial design to classification of Kac-Moody…
A $k$-ranking of a graph $G$ is a labeling of its vertices from $\{1,\ldots,k\}$ such that any nontrivial path whose endpoints have the same label contains a larger label. The least $k$ for which $G$ has a $k$-ranking is the ranking number…
We prove that for any fixed $k$, the probability that a random vertex of a random increasing plane tree is of rank $k$, that is, the probability that a random vertex is at distance $k$ from the leaves, converges to a constant $c_k$ as the…
We use methods from spectral graph theory to obtain bounds on the number of incidences between $k$-planes and $h$-planes in $\mathbb{F}_q^d$ which generalize a recent result given by Bennett, Iosevich, and Pakianathan (2014). More…