Related papers: A Brouwer fixed point theorem for graph endomorphi…
We construct a Cartesian product G x H for finite simple graphs. It satisfies the Kuenneth formula: H^k(G x H) is a direct sum of tensor products H^i(G) x H^j(G) with i+j=k and so p(G x H,x) = p(G,x) p(H,y) for the Poincare polynomial…
Brouwer's Conjecture states that, for any graph $G$, the sum of the $k$ largest (combinatorial) Laplacian eigenvalues of $G$ is at most $|E(G)| + \binom{k+1}{2}$, $1 \leq k \leq n$. We present several interrelated results establishing…
The tau constant is an important invariant of a metrized graph, and it has applications in arithmetic properties of curves. We show how the tau constant of a metrized graph changes under successive edge contractions and deletions. We…
A graph $G$ is said to be determined by its generalized spectrum (DGS for short) if for any graph $H$, $H$ and $G$ are cospectral with cospectral complements implies that $H$ is isomorphic to $G$. It turns out that whether a graph $G$ is…
For discrete groups G, we introduce equivariant Nielsen invariants. They are equivariant analogs of the Nielsen number and give lower bounds for the number of fixed point orbits in the G-homotopy class of an equivariant endomorphism f:X->X.…
We introduce (weak) oddomorphisms of graphs which are homomorphisms with additional constraints based on parity. These maps turn out to have interesting properties (e.g., they preserve planarity), particularly in relation to homomorphism…
We introduce a new cohomology theory for planar trivalent graphs with perfect matchings. The graded Euler characteristic of the cohomology is a one variable polynomial called the 2-factor polynomial that, if nonzero when evaluated at one,…
In this paper, we initiate the study of endomorphisms and modular theory of the graph C*-algebras $\O_{\theta}$of a 2-graph $\Fth$ on a single vertex. We prove that there is a semigroup isomorphism between unital endomorphisms of…
We prove that every $P_5$-free graph of bounded clique number contains a small hitting set of all its maximum stable sets. More generally, let us say a class $\mathcal{C}$ of graphs is $\eta$-bounded if there exists a function…
Characterizing graphs by their spectra is an important topic in spectral graph theory, which has attracted a lot of attention of researchers in recent years. It is generally very hard and challenging to show a given graph to be determined…
We prove two general factorization theorems for fixed-point invariants of fibrations: one for the Lefschetz number and one for the Reidemeister trace. These theorems imply the familiar multiplicativity results for the Lefschetz and Nielsen…
Given a finite simple graph G, let G' be its barycentric refinement: it is the graph in which the vertices are the complete subgraphs of G and in which two such subgraphs are connected, if one is contained into the other. If L(0)=0<L(1) <=…
We introduce a directed graph related to a group $G$, which we call the N-prime graph $\Gamma_{\rm{N}}(G)$ of $G$ and which is a refinement of the classical Gruenberg-Kegel graph. The vertices of $\Gamma_{\rm{N}}(G)$ are the primes $p$ such…
Given an abstract simplicial complex G, the connection graph G' of G has as vertex set the faces of the complex and connects two if they intersect. If A is the adjacency matrix of that connection graph, we prove that the Fredholm…
In this paper we give a new generalization of token graphs. Given two integers $1\leq m \leq k$ and a graph $G$ we define the generalized token graph of the graph $G$, to be the graph $F_k^m(G)$ whose vertices correspond to configurations…
Let $R(\phi)$ be the number of $\phi$-conjugacy (or Reidemeister) classes of an endomorphism $\phi$ of a group $G$. We prove for several classes of groups (including polycyclic) that the number $R(\phi)$ is equal to the number of fixed…
Lott-Sturm-Villani theory of curvature on geodesic spaces has been extended to discrete graph spaces by C. L{\'e}onard by replacing W2-Wasserstein geodesics by Schr{\"o}odinger bridges in the definition of entropic curvature [23, 25, 24].…
Originating from spectral graph theory, cospectrality is a powerful generalization of exchange symmetry and can be applied to all real-valued symmetric matrices. Two vertices of an undirected graph with real edge weights are cospectral iff…
\"Uberhomology is a recently defined homology theory for simplicial complexes, which yields subtle information on graphs. We prove that bold homology, a certain specialisation of \"uberhomology, is related to dominating sets in graphs. To…
We develop a general theory of local stability up to belonging to an ideal (e.g. having measure zero). From a model-theoretic perspective, we prove a stationarity principle for almost stable formulas in this sense, and build a topological…