English
Related papers

Related papers: Stiefel Manifolds and Coloring the Pentagon

200 papers

We show P\'eter Csorba's conjecture that the graph homomorphism complex Hom(C_5,K_{n+2}) is homeomorphic to a Stiefel manifold, the space of unit tangent vectors to the n-dimensional sphere. For this a general tool is developed that allows…

Combinatorics · Mathematics 2007-05-23 Carsten Schultz

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 · Mathematics 2007-05-23 Eric Babson , Dmitry N. Kozlov

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…

Algebraic Topology · Mathematics 2007-05-23 Dmitry N. Kozlov

For any two graphs $G$ and $H$ Lov\'asz has defined a cell complex $Hom(G,H)$ having in mind the general program that the algebraic invariants of these complexes should provide obstructions to graph colorings. Here we announce the proof of…

Combinatorics · Mathematics 2007-05-23 Eric Babson , Dmitry N. Kozlov

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…

Combinatorics · Mathematics 2007-05-23 Sonja Lj. Cukic , Dmitry N. Kozlov

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…

Combinatorics · Mathematics 2007-05-23 Carsten Schultz

In the way of proving Kneser's conjecture, L\'{a}szl\'{o} Lov\'{a}sz settled out a new lower bound for the chromatic number of graphs. He showed that if the hom complex $||Hom(\mathcal{K}_2, H)||$ of a graph $H$ is topologically…

Combinatorics · Mathematics 2017-09-21 Hamid Reza Daneshpajouh

In this paper we study implications of folds in both parameters of Lov\'asz' Hom(-,-) complexes. There is an important connection between the topological properties of these complexes and lower bounds for chromatic numbers. We give a very…

Combinatorics · Mathematics 2007-05-23 Dmitry N. Kozlov

We show that the n-th power of the first Stiefel-Whitney class of the Z_2-operation on the graph complex Hom(C_{2r+1},K_{n+2})$ is zero, confirming a conjecture by Babson and Kozlov. This proves the strong form of their graph colouring…

Algebraic Topology · Mathematics 2007-05-23 Carsten Schultz

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…

Combinatorics · Mathematics 2007-05-23 Alexander Engstrom

The Lov\'asz complex $L(G)$ of a graph $G$ is a deformation retract of its neighborhood complex, equipped with a canonical $Z_2$-action. We show that, under mild assumptions, $L(G)$ is homeomorphic to a surface if and only if $G$ is a…

Combinatorics · Mathematics 2025-10-07 Carmen Arana , Matěj Stehlík

We solve the isomorphism problem for the whole class of Lins-Mandel gems (graphs encoded manifolds). We also present certain homeomorphisms of branched cyclic coverings of two-bridge hyperbolic links. As a consequence, we prove that, in in…

Geometric Topology · Mathematics 2007-05-23 Sostenes Lins , Michele Mulazzani

$Hom(G,H)$ is a polyhedral complex defined for any two undirected graphs $G$ and $H$. This construction was introduced by Lov\'asz to give lower bounds for chromatic numbers of graphs. In this paper we initiate the study of the topological…

Combinatorics · Mathematics 2007-05-23 Eric Babson , Dmitry N. Kozlov

We exhibit two three-parameter families of locally conformal symplectic forms on the solvmanifold $M_{n,k}$ considered in [1], and show, using the Hodge-de Rham theory for the Lichnerowicz cohomology that that they are not $d_{\omega}$…

Symplectic Geometry · Mathematics 2007-05-23 Augustin Banyaga

Inspired by Kronheimer and Mrowka's approach to monopole Floer homology, we develop a model for $\mathbb{Z}/2$-equivariant symplectic Floer theory using equivariant almost complex structures, which admits a localization map to a twisted…

Symplectic Geometry · Mathematics 2019-10-29 Tim Large

Lov\'asz (1967) showed that two finite relational structures A and B are isomorphic if, and only if, the number of homomorphisms from C to A is the same as the number of homomorphisms from C to B for any finite structure C. Soon after,…

Logic in Computer Science · Computer Science 2022-09-05 Anuj Dawar , Tomáš Jakl , Luca Reggio

We conjecture an explicit formula for a cyclic analog of the Formality $L_{\infty}$-morphism [K]. We prove that its first Taylor component, the cyclic Hochschild-Kostant-Rosenberg map, is in fact a morphism (and a quasiisomorphism) of the…

Quantum Algebra · Mathematics 2009-09-25 Boris Shoikhet

The Lichnerowicz conjecture asserts that all harmonic manifolds are either flat or locally symmetric spaces of rank 1. This conjecture has been proved by Z.I. Szabo for harmonic manifolds with compact universal cover. E. Damek and F. Ricci…

Differential Geometry · Mathematics 2013-02-18 Gerhard Knieper , Norbert Peyerimhoff

We give a (computer assisted) proof that the edges of every graph with maximum degree 3 and girth at least 17 may be 5-colored (possibly improperly) so that the complement of each color class is bipartite. Equivalently, every such graph…

Combinatorics · Mathematics 2009-10-23 Matt DeVos , Robert Samal

Kneser's 1955 conjecture -- proven by Lov\'asz in 1978 -- asserts that in any partition of the $k$-subsets of $\{1, 2, \dots, n\}$ into $n-2k-3$ parts, one part contains two disjoint sets. Schrijver showed that one can restrict to…

Combinatorics · Mathematics 2017-10-27 Florian Frick
‹ Prev 1 2 3 10 Next ›