Related papers: Double graph complex and characteristic classes of…
For a flexible labeling of a graph, it is possible to construct infinitely many non-equivalent realizations keeping the distances of connected points constant. We give a combinatorial characterization of graphs that have flexible labelings.…
We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…
Graphs are called navigable if one can find short paths through them using only local knowledge. It has been shown that for a graph to be navigable, its construction needs to meet strict criteria. Since such graphs nevertheless seem to…
In this paper, we characterize the second bounded characteristic classes of foliated bundles in terms of the non-descendible quasi-morphisms on the universal covering of the structure group. As its application, we study the boundedness of…
Graphs derived from groups are a widely studied class of graphs, motivated by their highly symmetric structure. In particular, G-graphs offer an easy and interesting alternative construction of semi-symmetric graphs. After recalling the…
Phylogenetic networks are becoming of increasing interest to evolutionary biologists due to their ability to capture complex non-treelike evolutionary processes. From a combinatorial point of view, such networks are certain types of rooted…
It is known that non-isomorphic strongly regular graphs with the same parameters must be cospectral (have the same eigenvalues). In this paper, we investigate whether the spectra of higher order Laplacians associated with these graphs can…
Fourteen kinds of triangle singularities with modality one in Arnold's classification list are discussed. We consider which kinds of combinations of rational double points can appear on small deformation fibers of the singularities. We show…
A rigidity theory is developed for frameworks in a metric space with two types of distance constraints. Mixed sparsity graph characterisations are obtained for the infinitesimal and continuous rigidity of completely regular bar-joint…
Let (F,u)\to P\to N be a symplectic fibration in math.SG/0503268 McDuff has defined a subgroup Ham^s(F,u) of the group of symplectic automorphisms of(F,u). She has shown that the cohomology class [u] of u can be extended to P if and only if…
We consider birational projective contractions f:X -> Y from a smooth symplectic variety X over the complex numbers. We first show that exceptional rational curves on X deform in a family of dimension at least 2n-2. Then we show that these…
The independence complex $\mathrm{Ind}(G)$ of a graph $G$ is the simplicial complex formed by its independent sets. This article introduces a deformation of the simplicial boundary map of $\mathrm{Ind}(G)$ that gives rise to a double…
The matching complex $M(G)$ of a graph $G$ is the set of all matchings in $G$. A Buchsbaum simplicial complex is a generalization of both a homology manifold and a Cohen--Macaulay complex. We give a complete characterization of the graphs…
We develop some theory of double fibration transforms where the cycle space is a smooth manifold and apply it to complex projective space.
Much information about a graph can be obtained by studying its spanning trees. On the other hand, a graph can be regarded as a 1-dimensional cell complex, raising the question of developing a theory of trees in higher dimension. As observed…
The increasing prevalence of graph-structured data across various domains has intensified greater interest in graph classification tasks. While numerous sophisticated graph learning methods have emerged, their complexity often hinders…
In Chapter 1 we fully characterise pairs of finite graphs which form a gap in the full homomorphism order. This leads to a simple proof of the existence of generalised duality pairs. We also discuss how such results can be carried to…
We investigate structural and combinatorial properties of Bi-Cayley graphs defined over cyclic groups of order $p^2q^2$, where $p$ and $q$ are distinct primes. We begin by describing their fundamental group-theoretic underpinnings. The main…
Regular colored graphs are dual representations of pure colored D-dimensional complexes. These graphs can be classified with respect to an integer, their degree, much like maps are characterized by the genus. We analyse the structure of…
We generalize Kontsevich's construction of characteristic classes of fibre bundles with homology sphere fibres and a trivialization of the vertical tangent bundle to framed fibre bundles with closed manifold fibres.