相关论文: Cobounding odd cycle colorings

The theory of quandle (co)homology and cocycle knot invariants is rapidly being developed. We begin with a summary of these recent advances. One such advance is the notion of a dynamical cocycle. We show how dynamical cocycles can be used…

We prove that every finite colouring of the plane contains a monochromatic pair of points at an odd distance from each other.

We give an explicit description, in terms of bracket, anchor, and pairing, of the standard cochain complex associated to a Courant algebroid. In this formulation, the differential satisfies a formula that is formally identical to the Cartan…

An odd $k$-edge-coloring of a graph $G$ is a (not necessarily proper) edge-coloring with at most $k$ colors such that each non-empty color class induces a graph in which every vertex is of odd degree; similarly, if more than one color per…

We show that a finite coloring of an amenable group contains `many' monochromatic sets of the form $\{x,y,xy,yx\},$ and natural extensions with more variables. This gives the first combinatorial proof and extensions of Bergelson and…

We provide a short proof of a conic version of the colorful Carath\'eodory theorem for oriented matroids. Holmsen's extension of the colorful Carath\'eodory theorem to oriented matroids (Advances in Mathematics, 2016) already encompasses…

We prove Kontsevich's cyclic formality conjecture.

We show that the spectral action, when perturbed by a gauge potential, can be written as a series of Chern--Simons actions and Yang--Mills actions of all orders. In the odd orders, generalized Chern--Simons forms are integrated against an…

We collect some of our favorite proofs of Brooks' Theorem, highlighting advantages and extensions of each. The proofs illustrate some of the major techniques in graph coloring, such as greedy coloring, Kempe chains, hitting sets, and the…

We develop an obstruction theory for Hirsch extensions of cbba's with twisted coefficients. This leads to a variety of applications, including a structural theorem for minimal cbba's, a construction of relative minimal models with twisted…

We show that for any positive integer $r$ there exists an integer $k$ and a $k$-colouring of the edges of $K_{2^{k}+1}$ with no monochromatic odd cycle of length less than $r$. This makes progress on a problem of Erd\H{o}s and Graham and…

We prove a quantitative version of the multi-colored Motzkin-Rabin theorem in the spirit of [BDWY12]: Let $V_1,\ldots,V_n \subset R^d$ be $n$ disjoint sets of points (of $n$ `colors'). Suppose that for every $V_i$ and every point $v \in…

We study the class of simple graphs $\mathcal{G}^*$ for which every pair of distinct odd cycles intersect in at most one edge. We give a structural characterization of the graphs in $\mathcal{G}^*$ and prove that every $G \in \mathcal{G}^*$…

Motivated by colouring minimal Cayley graphs, in 1978, Babai conjectured that no-lonely-colour graphs have bounded chromatic number. We disprove this in a strong sense by constructing graphs of arbitrarily large girth and chromatic number…

Let $H$ be a graph with $\Delta(H) \leq 2$, and let $G$ be obtained from $H$ by gluing in vertex-disjoint copies of $K_4$. We prove that if $H$ contains at most one odd cycle of length exceeding $3$, or if $H$ contains at most $3$…

We consider colored compositions where only some parts are allowed different colors, depending on their locations in the composition. The counting sequences are obtained through generating functions. Connections to many other combinatorial…

We study the problem of finding homomorphisms into odd cycles from planar graphs with high odd-girth. The Jaeger-Zhang conjecture states that every planar graph of odd-girth at least $4k+1$ admits a homomorphism to the odd cycle $C_{2k+1}$.…

A special class of braids, called woven, is introduced and it is shown that every conjugation class of the braid group contains woven braids. In consequence, links can be presented as plats or closures of woven braids. Restricting on knots,…

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…

In this dissertation, we extend the odd Khovanov bracket to link cobordisms and prove that our construction is functorial up to sign. We then build an odd Khovanov theory for dotted link cobordisms. Out of the dotted theory, a module…