相关论文: A categorification for the chromatic polynomial

Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…

The moduli space of rank $n$ graphs, the outer automorphism group of the free group of rank $n$ and Kontsevich's Lie graph complex have the same rational cohomology. We show that the associated Euler characteristic grows like…

A 1-selection $f$ of a graph $G$ is a function $f: V(G)\rightarrow E(G)$ such that $f(v)$ is incident to $v$ for every vertex $v$. The 1-removed $G_f$ is the graph $(V(G),E(G)\setminus f[V(G)])$. The (1-)robust chromatic number $\chi_1(G)$…

We investigate an algebraic problem related to the determination of the fundamental group of a class of spaces of configurations on surfaces. The configuration spaces are spaces of points grouped into colors. Whether two points are allowed…

We supply an upper bound on the distinguishing chromatic number of certain infinite graphs satisfying an adjacency property. Distinguishing proper $n$-colourings are generalized to the new notion of distinguishing homomorphisms. We prove…

By Lovasz' proof of the Kneser conjecture, the chromatic number of a graph G is bounded from below by the index of the Z_2-space Hom(K_2,G) plus two. We show that the cohomological index of Hom(K_2,G) is also greater than the cohomological…

Motivated by Dohmen-P\"onitz-Tittmann's bivariate chromatic polynomial $\chi_G(x,y)$, which counts all $x$-colorings of a graph $G$ such that adjacent vertices get different colors if they are $\le y$, we introduce a bivarate version of…

Khovanov homology ist a new link invariant, discovered by M. Khovanov, and used by J. Rasmussen to give a combinatorial proof of the Milnor conjecture. In this thesis, we give examples of mutant links with different Khovanov homology. We…

In this paper, we try to determine exact or bounds on the choosability, or list chromatic numbers of some Cayley graphs, typically some Unitary Cayley graphs and Cayley graphs on Dihedral groups.

A complete partition of a graph $G$ is a partition of the vertex set such that there is at least one edge between any two parts. The largest $r$ such that $G$ has a complete partition into $r$ parts, each of which is an independent set, is…

We prove standard results of group cohomology -- namely, existence of a long exact sequence, classification of torsors via the first cohomology group, Shapiro's lemma, the Hochschild-Serre spectral sequence, a decomposition of the cochain…

This work represents the concept of an n-groupoid $ \Gamma^n $ and n-characters $ \chi_n $ on n-groupoids as complex-valued maps from spaces of different classes of morphisms satisfying the condition $ \chi_n (\psi \circ_k \varphi) = \chi_n…

We study the cohomology of complexes of ordinary (non-decorated) graphs, introduced by M. Kontsevich. We construct spectral sequences converging to zero whose first page contains the graph cohomology. In particular, these series may be used…

We examine the Hochschild cohomology governing graded deformations for finite cyclic groups acting on polynomial rings. We classify the infinitesimal graded deformations of the skew group algebra $S\rtimes G$ for a cyclic group $G$ acting…

Graph homomorphism has been studied intensively. Given an m x m symmetric matrix A, the graph homomorphism function is defined as \[Z_A (G) = \sum_{f:V->[m]} \prod_{(u,v)\in E} A_{f(u),f(v)}, \] where G = (V,E) is any undirected graph. The…

Given a graph $G$ of order $n$, the $\sigma$-$polynomial$ of $G$ is the generating function $\sigma(G,x) = \sum a_{i}x^{i}$ where $a_{i}$ is the number of partitions of the vertex set of $G$ into $i$ nonempty independent sets. Such…

Besides offering a friendly introduction to knot homologies and quantum curves, the goal of these lectures is to review some of the concrete predictions that follow from the physical interpretation of knot homologies. In particular, this…

Richard P. Stanley defined the chromatic symmetric function of a simple graph and has conjectured that every tree is determined by its chromatic symmetric function. Recently, Takahiro Hasebe and the author proved that the order…

Recently, M.\ Ab\'ert and T.\ Hubai studied the following problem. The chromatic measure of a finite simple graph is defined to be the uniform distribution on its chromatic roots. Ab\'ert and Hubai proved that for a Benjamini-Schramm…

The road colouring theorem characterizes the class of strongly connected directed graphs with constant out-degree that admit a synchronizing road colouring. The subject of this paper is a pair of related conjectures that generalize the road…