Related papers: Isometric embeddings of Johnson graphs in Grassman…

For every graph $G$, let $\alpha(G)$ denote its independence number. What is the minimum of the maximum degree of an induced subgraph of $G$ with $\alpha(G)+1$ vertices? We study this question for the $n$-dimensional Hamming graph over an…

We study the regularity of the isometric embedding X: (B(O,r),g) -> (R3, gcan) of a 2-ball with nonnegatively curved C4 metric into R3. Under the assumption that X can be expressed in the graph form, we show X is C2,1 near P, which is…

Let $G$ be a graph on $n$ vertices. The $k$-token graph (or symmetric $k$-th power) of $G$, denoted by $F_k(G)$ has as vertices the ${n\choose k}$ $k$-subsets of vertices from $G$, and two vertices are adjacent when their symmetric…

A graph ${\mathcal G}$ is locally X if the graphs induced on the neighbours of every vertex of ${\mathcal G}$ are isomorphic to the graph $X$. We prove that the infinite family of incidence graphs of the $r$-rank incidence geometries,…

We classify all the embeddings of P^n in a Grassmannian of lines G(1,N) such that the composition with Pl\"ucker is given by a linear system of quadrics of P^n.

The (n,k)-arrangement graph A(n,k) is a graph with all the k-permutations of an n-element set as vertices where two k-permutations are adjacent if they agree in exactly k-1 positions. We introduce a cyclic decomposition for k-permutations…

In this {paper}, we consider holomorphic embeddings of $Gr(2,m)$ into $Gr(2,n)$. We study such embeddings by finding all possible total Chern classes of the pull-back of the universal bundles under these embeddings. Using the relations…

A $k$-star is a complete bipartite graph $K_{1,k}$. For a graph $G$, a $k$-star decomposition of $G$ is a set of $k$-stars in $G$ whose edge sets partition the edge set of $G$. If we weaken this condition to only demand that each edge of…

The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstein [SODA 95, J'GAA 99] gives the first linear time algorithm for…

In [36, Section 8], the present author proposed the hypergraph obstruction for the existence of k-regular embeddings. In this paper, we develop the hypergraph obstruction concretely and give some homological obstructions for the k-regular…

We consider any classical Grassmannian geometry $\Gamma$; that is, any projective or polar Grassmann space. Suppose every line in $\Gamma$ contains $s+1$ points. Then we classify all sets of points in $\Gamma$ of cardinality $s+1$, with the…

Let $H$ be a complex Hilbert space and let ${\mathcal G}_{k}(H)$ be the Grassmannian formed by $k$-dimensional subspaces of $H$. Suppose that $\dim H>2k$ and $f$ is an orthogonality preserving injective transformation of ${\mathcal…

Let $H$ be an infinite-dimensional complex Hilbert space and let ${\mathcal L}(H)$ be the logic formed by all closed subspaces of $H$. For every natural $k$ we denote by ${\mathcal G}_{k}(H)$ the Grassmannian consisting of $k$-dimensional…

Let $G$ be a graph of order $n$ and let $k\in \{1,2,\ldots,n-1\}$. The $k$-token graph of $G$ is the graph, whose vertices are all the $k$-subsets of vertices of $G$, where two such $k$-sets are adjacent whenever their symmetric difference…

This paper considers *-graphs in which all vertices have degree 4 or 6, and studies the question of calculating the genus of orientable 2-surfaces into which such graphs may be embedded. A *-graph is a graph endowed with a formal adjacency…

We consider the graph whose vertex set is a conjugacy class ${\mathcal C}$ consisting of finite-rank self-adjoint operators on a complex Hilbert space $H$. The dimension of $H$ is assumed to be not less than $3$. In the case when operators…

We prove that for every closed, connected, orientable, irreducible 3-manifold, there exists an alternating group A_n which is not the topological symmetry group of any graph embedded in the manifold. We also show that for every finite group…

In this paper we give a lower bound for the least distortion embedding of a distance regular graph into Euclidean space. We use the lower bound for finding the least distortion for Hamming graphs, Johnson graphs, and all strongly regular…

In an $\mathsf{L}$-embedding of a graph, each vertex is represented by an $\mathsf{L}$-segment, and two segments intersect each other if and only if the corresponding vertices are adjacent in the graph. If the corner of each…

Let Emb(S^j,S^n) denote the space of C^infty-smooth embeddings of the j-sphere in the n-sphere. This paper considers homotopy-theoretic properties of the family of spaces Emb(S^j,S^n) for n >= j > 0. There is a homotopy-equivalence of…