Related papers: Isotropic matroids II: Circle graphs
Given a group $G$ of automorphisms of a matroid $M$, we describe the representations of $G$ on the homology of the independence complex of the dual matroid $M^*$. These representations are related with the homology of the lattice of flats…
The family of 2-level matroids, that is, matroids whose base polytope is 2-level, has been recently studied and characterized by means of combinatorial properties. 2-level matroids generalize series-parallel graphs, which have been already…
The theory of voltage graphs has become a standard tool in the study graphs admitting a semiregular group of automorphisms. We introduce the notion of a cyclic generalised voltage graph to extend the scope of this theory to graphs admitting…
We conjecture that the class of frame matroids can be characterised by a sentence in the monadic second-order logic of matroids, and we prove that there is such a characterisation for the class of bicircular matroids. The proof does not…
We extend to characteristic two recent results about isotropy of quadratic forms over function fields. In particular, we provide a characterization of function fields not only of quadratic forms but also more generally of polynomials in…
We observe that for planar graphs, the geometric duality relation generates both 2-isomorphism and abstract duality. This observation has the surprising consequence that for links, the equivalence relation defined by isomorphisms of…
For non-negative integers~$k$, we consider graphs in which every vertex has exactly $k$ vertices at distance~$2$, i.e., graphs whose distance-$2$ graphs are $k$-regular. We call such graphs $k$-metamour-regular motivated by the terminology…
We describe and illustrate the local neighbourhoods of vertices and edges in the (2, 2)-isogeny graph of principally polarized abelian surfaces, considering the action of automorphisms. Our diagrams are intended to build intuition for…
We are interested in overgroups of the automorphism group of the Rado graph. One class of such overgroups is completely understood; this is the class of reducts. In this article we tie recent work on various other natural overgroups, in…
In this short note we prove the Borel conjecture for a family of aspherical manifolds that includes higher graph manifolds.
Intersection graphs are very important in both theoretical as well as application point of view. Depending on the geometrical representation, different type of intersection graphs are defined. Among them interval, circular-arc, permutation,…
Mirror graphs were introduced by Bre\v{s}ar et al. in 2004 as an intriguing class of graphs: vertex-transitive, isometrically embeddable into hypercubes, having a strong connection with regular maps and polytope structure. In this article…
In this paper, we give an explicit description about the second Hochschild cohomology groups of bipartite Brauer graph algebras with trivial grading. Based on this, we provide geometric interpretations of deformations associated to some…
We study the complexity of the Graph Isomorphism problem on graph classes that are characterized by a finite number of forbidden induced subgraphs, focusing mostly on the case of two forbidden subgraphs. We show hardness results and develop…
In this paper we give two characterizations of the $p \times q$-grid graphs as co-edge-regular graphs with four distinct eigenvalues.
We compare the obstruction classes defined in arXiv:1101.4069 to those defined by Illusie. We also give sheaf theoretic proofs of some of the standard properties of the cotangent complex.
We characterise the structure of those graphs of a given order which maximise the number of connected induced subgraphs for seven different graph classes, each with other prescribed parameters like minimum degree, independence number,…
In this note we determine the obstruction to triviality of the stack of exact vertex algebroids.
We study topological properties of the graph topology.
We recall several known results about minimally 2-connected graphs, and show that they all follow from a decomposition theorem. Starting from an analogy with critically 2-connected graphs, we give structural characterizations of the classes…