Add to ORKGAbstract. Let P be a projective space. By H(P) we denote the graph whose vertices are the non-incident point-hyperplane pairs of P, two vertices (p,H) and (q, I) being adjacent if and only if p ∈ I and q ∈ H. In this paper we give a characterization of the graph H(P) (as well as of some related graphs) by its local structure. We apply this result by two characterizations of groups G with PSLn(F) ≤ G ≤ PGLn(F), by properties of centralizers of some (generalized) reflections. Here F is the (skew) field of coordinates of P. 1
We consider finite graphs with the property that there exists a constant e such that for every maxim...
If (P,L) is a projective plane and T is a triangle presentation compatible with a point-line corresp...
AbstractIt is shown that the cliques in a distance-regular graph Γ whose parameters are that of the ...
A central problem in synthetic geometry is the characterisation of graphs and geometries. The local ...
A central problem in synthetic geometry is the characterisation of graphs and geometries. The local ...
AbstractIt is shown that embeddings of planar graphs in the projective plane have very specific stru...
In this paper we study sets X of points of both affine and projective spaces over the Galois field ...
A graph G is a B0-VPG graph if one can associate a horizontal or vertical path on a rectangular grid...
We give a detailed algebraic characterization of when a graph G can be imbedded in the projective pl...
AbstractGrassmann graphs and Johnson graphs are graphs in which the neighbor of no vertex contains 3...
Hjelmslev-Moufang planes are point-line geometries related to the exceptional algebraic groups of ty...
AbstractWe generalize Kasteleyn's method of enumerating the perfect matchings in a planar graph to g...
Based on the third author’s thesis [Str08] in this article we complete the local recognition of comm...
AbstractA 2-geodesic in a graph is a vertex triple (u,v,w) such that v is adjacent to both u and w a...
We give several characterizations of partition lattices and projective geometries. Most of these cha...
We consider finite graphs with the property that there exists a constant e such that for every maxim...
If (P,L) is a projective plane and T is a triangle presentation compatible with a point-line corresp...
AbstractIt is shown that the cliques in a distance-regular graph Γ whose parameters are that of the ...
A central problem in synthetic geometry is the characterisation of graphs and geometries. The local ...
A central problem in synthetic geometry is the characterisation of graphs and geometries. The local ...
AbstractIt is shown that embeddings of planar graphs in the projective plane have very specific stru...
In this paper we study sets X of points of both affine and projective spaces over the Galois field ...
A graph G is a B0-VPG graph if one can associate a horizontal or vertical path on a rectangular grid...
We give a detailed algebraic characterization of when a graph G can be imbedded in the projective pl...
AbstractGrassmann graphs and Johnson graphs are graphs in which the neighbor of no vertex contains 3...
Hjelmslev-Moufang planes are point-line geometries related to the exceptional algebraic groups of ty...
AbstractWe generalize Kasteleyn's method of enumerating the perfect matchings in a planar graph to g...
Based on the third author’s thesis [Str08] in this article we complete the local recognition of comm...
AbstractA 2-geodesic in a graph is a vertex triple (u,v,w) such that v is adjacent to both u and w a...
We give several characterizations of partition lattices and projective geometries. Most of these cha...
We consider finite graphs with the property that there exists a constant e such that for every maxim...
If (P,L) is a projective plane and T is a triangle presentation compatible with a point-line corresp...
AbstractIt is shown that the cliques in a distance-regular graph Γ whose parameters are that of the ...