English
Related papers

Related papers: Embeddings of Grassmann graphs

200 papers

This note pertains to isometric embeddings endowed with certain geometric properties. We study two embedding problems for a Riemannian manifold $M$ which is diffeomorphic to $\RR^n$ and admits a Bieberbach group $\Gamma$ acting by…

Differential Geometry · Mathematics 2025-11-18 Dmitri Burago , Hongda Qiu

Due to their flexibility to represent almost any kind of relational data, graph-based models have enjoyed a tremendous success over the past decades. While graphs are inherently only combinatorial objects, however, many prominent analysis…

Social and Information Networks · Computer Science 2024-03-27 Michaël Fanuel , Antoine Aspeel , Michael T. Schaub , Jean-Charles Delvenne

Let $G=(V,E)$ be a finite, connected graph. We consider a greedy selection of vertices: given a list of vertices $x_1, \dots, x_k$, take $x_{k+1}$ to be any vertex maximizing the sum of distances to the existing vertices and iterate: we…

Combinatorics · Mathematics 2022-05-06 Stefan Steinerberger

We prove that the vertex set of any twin-free multigraph G has an embedding into some point set P of some Euclidean space Rk, such that the automorphism group of G is isomorphic to the isometry group of Rk globally preserving P.

Combinatorics · Mathematics 2007-05-23 Hubert De Fraysseix , Patrice Ossona De Mendez

We announce results about flat (linkless) embeddings of graphs in 3-space. A piecewise-linear embedding of a graph in 3-space is called {\it flat} if every circuit of the graph bounds a disk disjoint from the rest of the graph. We have…

Combinatorics · Mathematics 2016-09-06 Neil Robertson , Paul Seymour , Robin Thomas

Every graph G can be embedded in a Euclidean space as a two-distance set. The Euclidean representation number of G is the smallest dimension in which G is representable by such an embedding. We consider spherical and J-spherical…

Metric Geometry · Mathematics 2019-06-26 Oleg R. Musin

We study intrinsically linked graphs where we require that every embedding of the graph contains not just a non-split link, but a link that satisfies some additional property. Examples of properties we address in this paper are: a two…

Geometric Topology · Mathematics 2014-10-01 Thomas Fleming , Alexander Diesl

Let $\Gamma_{k}(V)$ be the Grassmann graph formed by $k$-dimensional subspaces of an $n$-dimensional vector space over the finite field ${\mathbb F}_{q}$ consisting of $q$ elements and $1<k<n-1$. Denote by $\Gamma(n,k)_q$ the restriction of…

Combinatorics · Mathematics 2016-03-22 Mariusz Kwiatkowski , Mark Pankov

The regular embeddings of complete bipartite graphs $K_{n,n}$ in orientable surfaces are classified and enumerated, and their automorphism groups and combinatorial properties are determined. The method depends on earlier classifications in…

Combinatorics · Mathematics 2014-02-26 Gareth A. Jones

Let $k \subset K$ be an extension of fields, and let $A \subset M_{n}(K)$ be a $k$-algebra. We study parameter spaces of $m$-dimensional subspaces of $K^{n}$ which are invariant under $A$. The space $\mathbb{F}_{A}(m,n)$, whose $R$-rational…

Algebraic Geometry · Mathematics 2009-02-27 A. Nyman

We introduce the class of transparent embeddings for a point-line geometry $\Gamma = ({\mathcal P},{\mathcal L})$ as the class of full projective embeddings $\varepsilon$ of $\Gamma$ such that the preimage of any projective line fully…

Algebraic Geometry · Mathematics 2018-04-11 Ilaria Cardinali , Luca Giuzzi , Antonio Pasini

Let $n$ be a positive integer, $q$ be a prime power, and $V$ be a vector space of dimension $n$ over $\mathbb{F}_q$. Let $G := V \rtimes G_0$, where $G_0$ is an irreducible subgroup of ${\rm GL}(V)$ which is maximal by inclusion with…

Combinatorics · Mathematics 2016-01-29 Carmen Amarra , Michael Giudici , Cheryl E. Praeger

Using connections to random matrix theory and orthogonal polynomials, we develop a framework for obtaining explicit closed-form formulae for the number, $\mathscr{N}_{g}(2\nu,j)$, of connected $2\nu$-valent labeled graphs with $j$ vertices…

Combinatorics · Mathematics 2025-09-19 Roozbeh Gharakhloo , Tomas Lasic Latimer

We consider a class of graphs subject to certain restrictions, including the finiteness of diameters. Any surjective mapping $\phi:\Gamma\to\Gamma'$ between graphs from this class is shown to be an isomorphism provided that the following…

Combinatorics · Mathematics 2024-02-05 Wen-ling Huang , Hans Havlicek

Let $n,k$ be positive integers such that $n\geq 3$, $k < \frac {n}{2} $. Let $q$ be a power of a prime $p$ and $\mathbb{F}_q$ be a finite field of order $q$. Let $V(q,n)$ be a vector space of dimension $n$ over $\mathbb{F}_q$. We define the…

Combinatorics · Mathematics 2021-03-12 S. Morteza Mirafzal , Roya Kogani

The Grassmannians of lines in projective N-space, G(1,N), are embedded by way of the Pl"ucker embedding in the projective space P(\bigwedge^2 C^{N+1}). Let H^l be a general l-codimensional linear subspace in this projective space. We…

Algebraic Geometry · Mathematics 2007-05-23 J. Piontkowski , A. Van de Ven

Let $\mathbb{F}_q$ denote a finite field with $q$ elements. Let $n,k$ denote integers with $n>2k\geq 6$. Let $V$ denote a vector space over $\mathbb{F}_{q}$ that has dimension $n$. The vertex set of the Grassmann graph $J_q(n,k)$ consists…

Combinatorics · Mathematics 2025-09-19 Ian Seong

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…

Combinatorics · Mathematics 2025-07-04 Sira Busch , Hendrik Van Maldeghem

We describe two locally finite graphs naturally associated to each knot type K, called Reidemeister graphs. We determine several local and global properties of these graphs and prove that in one case the graph-isomorphism type is a complete…

Geometric Topology · Mathematics 2020-04-29 Agnese Barbensi , Daniele Celoria

A subgraph $H$ of a graph $G$ is isometric if the distances between vertices in $H$ coincide with the distances between the corresponding vertices in $G$. We show that for any integer $n\ge 1$, there is a graph on $3^{n+O(\log^2 n)}$…

Combinatorics · Mathematics 2021-06-24 Louis Esperet , Cyril Gavoille , Carla Groenland