相关论文: Parallel transport of $Hom$-complexes and the Lova…

A foundation is laid for a theory of combinatorial groupoids, allowing us to use concepts like ``holonomy'', ``parallel transport'', ``bundles'', ``combinatorial curvature'' etc. in the context of simplicial (polyhedral) complexes, posets,…

The Hom-complexes were introduced by Lovasz to study topological obstructions to graph colorings. It was conjectured by Babson and Kozlov, and proved by Cukic and Kozlov, that Hom(G,K_n) is (n-d-2)-connected, where d is the maximal degree…

We investigate a notion of $\times$-homotopy of graph maps that is based on the internal hom associated to the categorical product in the category of graphs. It is shown that graph $\times$-homotopy is characterized by the topological…

In two seminal papers M. Kontsevich introduced graph homology as a tool to compute the homology of three infinite dimensional Lie algebras, associated to the three operads `commutative,' `associative' and `Lie.' We generalize his theorem to…

An objective of the theory of combinatorial groupoids is to introduce concepts like "holonomy", "parallel transport", "bundles", "combinatorial curvature" etc. in the context of simplicial (polyhedral) complexes, posets, graphs, polytopes,…

To any two graphs G and H one can associate a cell complex Hom(G,H) by taking all graph multihomorphisms from G to H as cells. In this paper we prove the Lovasz Conjecture which states that if Hom(C_{2r+1},G) is k-connected, then…

Combinatorics, in particular graph theory, has a rich history of being a domain of successful applications of tools from other areas of mathematics, including topological methods. Here, we survey the study of the Hom-complexes, and the ways…

The main result of this paper is a proof of the following conjecture of Babson & Kozlov: Theorem. Let G be a graph of maximal valency d, then the complex Hom(G,K_n) is at least (n-d-2)-connected. Here Hom(-,-) denotes the polyhedral complex…

The neighborhood complex of a graph was introduced by Lov\'asz to provide topological lower bounds on chromatic number. More general homomorphism complexes of graphs were further studied by Babson and Kozlov. Such `Hom complexes' are also…

Graph homomorphism has been an important research topic since its introduction [17]. Stated in the language of binary relational structures in that paper [17], Lov\'asz proved a fundamental theorem that, for a graph $H$ given by its $0$-$1$…

Let ${\mathcal C}$ be the category of finite graphs. Lov\`{a}sz (1967) shows that if $|\mathrm{Hom}(X,A)|=|\mathrm{Hom}(X,B)|$ holds for any $X$, then $A$ is isomorphic to $B$. Pultr (1973) gives a categorical generalization using a similar…

We study Maxim Kontsevich's graph complex $GC_d$ for any integer $d$ as well as its oriented and targeted versions, and show new short proofs of the theorems due to Thomas Willwacher and Marko Zivkovic which establish isomorphisms of their…

In this article we define a minor relation, which is stronger than the classical one, but too strong to become a well-quasi-order on the class of finite graphs. Nevertheless, with this terminology we are able to introduce a conjecture,…

For a pair $(H_1,H_2)$ of graphs, Lov\'{a}sz introduced a polytopal complex called the Hom complex $\text{Hom}(H_1,H_2)$, in order to estimate topological lower bounds for chromatic numbers of graphs. The definition is generalized to…

We prove that the inclusion from oriented graph complex into graph complex with at least one source is a quasi-isomorphism, showing that homology of the "sourced" graph complex is also equal to the homology of standard Kontsevich's graph…

Lov\'{a}sz conjectured that every connected vertex-transitive graph contains a hamilton path in 1970. First we reveal the structure of connected vertex-transitive graphs with an odd number of vertices. Then we prove that every connected…

We prove a Lie 2-group torsor version of the well-known one-one correspondence between fibered categories and pseudofunctors. Consequently, we obtain a weak version of the principal Lie group bundle over a Lie groupoid. The correspondence…

A concise discussion of the axiomatic approach to the concept of parallel transport is presented. Attention is drawn to a bijective map between the sets of connections and (axiomatically defined) parallel transports. The transports along…

We study the uniqueness of optimal solutions to extremal graph theory problems. Lovasz conjectured that every finite feasible set of subgraph density constraints can be extended further by a finite set of density constraints so that the…

In this article, we give conditions on a graph under which the Lov\'{a}sz' original bound of the graph can be improved by increasing the topological connectivity of its neighbourhood complex. We also work out conditions under which…