Related papers: Vizing's conjecture for cographs

In this paper we define an algebra structure on the vector space $L(\Sigma)$ generated by links in the manifold $\Sigma \times [0,1]$ where $\Sigma $ is an oriented surface. This algebra has a filtration and the associated graded algebra…

Grohe and Marx proved that if G does not contain H as a topological minor, then there exist constants g=O(|V(H)|^4), D and t depending only on H such that G is a clique sum of graphs that either contain at most t vertices of degree greater…

Associated to a finite graph $X$ is its quantum automorphism group $G(X)$. We prove a formula of type $G(X*Y)=G(X)*_wG(Y)$, where $*_w$ is a free wreath product. Then we discuss representation theory of free wreath products, with the…

We prove that for every prime $p$ algebraically clean graphs of groups are virtually residually $p$-finite and cohomologically $p$-complete. We also prove that they are cohomologically good. We apply this to certain $2$-dimensional Artin…

We show that any two Hadamard graphs on the same number of vertices are quantum isomorphic. This follows from a more general recipe for showing quantum isomorphism of graphs arising from certain association schemes. The main result is built…

For a graph $G$, let $\chi(G)$ and $\omega(G)$ respectively denote the chromatic number and clique number of $G$. We give an explicit structural description of ($P_5$,gem)-free graphs, and show that every such graph $G$ satisfies…

In the paper \cite{KS}, Kontsevich and Soibelman in particular associate to each finite quiver $Q$ with a set of vertices $I$ the so-called Cohomological Hall algebra $\cH,$ which is $\Z_{\geq 0}^I$-graded. Its graded component…

Given finite simple graphs $G$ and $H$, the Hom complex $\mathrm{Hom}(G,H)$ is a polyhedral complex having the graph homomorphisms $G\to H$ as the vertices. We determine the homotopy type of each connected component of $\mathrm{Hom}(G,H)$…

A graph is said to be symmetric if its automorphism group is transitive on its arcs. Guo et al. (Electronic J. Combin. 18, \#P233, 2011) and Pan et al. (Electronic J. Combin. 20, \#P36, 2013) determined all pentavalent symmetric graphs of…

A graph is $H$-free if it does not contain $H$ as a subgraph. The diamond graph is the graph obtained from $K_4$ by deleting one edge. We prove that if $G$ is a connected graph with order $n\geq 10$, then there exists a subset $S\subseteq…

We offer a direct proof of an elementary result concerning cohomological periods. As a corollary we show that given a finitely generated stably free resolution of Z over a finite group, two of its modules are free.

A group $G$ is said to be just infinite if $G$ itself is infinite but all proper quotients of $G$ are finite. We show that a Coxeter group $W_\Gamma$ is just infinite if and only if $\Gamma$ is isomorphic to one of the following graphs:…

The power domination problem focuses on finding the optimal placement of phase measurement units (PMUs) to monitor an electrical power network. In the context of graphs, the power domination number of a graph $G$, denoted $\gamma_P(G)$, is…

A graph K is square-free if it contains no four-cycle as a subgraph. A graph K is multiplicative if GxH -> K implies G -> K or H -> K, for all graphs G,H. Here GxH is the tensor (or categorical) graph product and G -> K denotes the…

We present several approaches to equivariant intersection cohomology. We show that for a complete algebraic variety acted by a connected algebraic group $G$ it is a free module over $H^*(BG)$. The result follows from the decomposition…

Let $G$ be a complex simply connected semisimple Lie group and let $\Gamma$ be a torsionless uniform irreducible lattice in $G$. Then $\Gamma\backslash G$ is a compact complex non-K\"ahler manifold whose tangent bundle is holomorphically…

Let $h(G)$ denote the largest $t$ such that $G$ contains $K_t$ as a minor and $\chi(G)$ be the chromatic number of $G$ respectively. In 1943, Hadwiger conjectured that $h(G) \geq \chi(G)$ for any graph $G$. In this paper, we prove that…

In this series of papers, we established that $Q^{\gamma_3}_{d=4}(P)$ is a coboundary in 4D (paper II arXiv:2409.12555), and we presented a series of experimental results about the (non)trivialisation of Kontsevich graph flows of…

For a graph $G$, let $\chi(G)$ denote the chromatic number of $G$. Given a graph $G$, the $reconfiguration$ $graph$ $for$ $the$ $k$-$colorings$ of $G$, denoted by ${\cal R}_k(G)$, is the graph whose vertices are the $k$-colorings of $G$ and…

We consider a connected graph $\Gamma$ as a coarse space and prove that $\Gamma$ admits a 2-selector if and only if $\Gamma$ is either bounded or coarsely equivalent to $\mathbb{N}$ or $\mathbb{Z}$. We apply this result to geodesic metric…