相关论文: Cobounding odd cycle colorings

The Cartan formula relates the cup product and the action of the Steenrod algebra on mod~$p$ cohomology. For any pair of mod $p$ cocycles in a simplicial set, where $p$ is an odd prime, we effectively construct a natural coboundary…

The paper is devoted to the study of combinatorial determinacy properties of a family of substitution complexes consisting of quadrilaterals glued side-to-side with each other. These properties are useful in constructing algebraic…

Properly colored cycles in edge-colored graphs are closely related to directed cycles in oriented graphs. As an analogy of the well-known Caccetta-H\"{a}ggkvist Conjecture, we study the existence of properly colored cycles of bounded length…

An {\em odd subgraph} of a graph is a subgraph in which every vertex has odd degree. A graph $G$ is said to be {\em odd $k$-edge-colorable} if there exists an edge-coloring $E(G) \rightarrow \{1,2, \ldots, k\}$ such that each non-empty…

A cycle system of order $n$ is a decomposition of the edges of the complete graph $K_n$ into cycles of a fixed length. A cycle system is said to be $k$-colourable if we can assign $k$ colours to its vertices so that no cycle is…

Four-Color Theorem has secret in its logical proof and actual operating. In this paper we will give a proof of Four-Color Theorem based on Kuratowski's Theorem using some induction argument and give a description of the most complicated…

This is a report on our ongoing research on a combinatorial approach to knot recognition, using coloring of knots by certain algebraic objects called quandles. The aim of the paper is to summarize the mathematical theory of knot coloring in…

It is consistent for every (1 <= n< omega) that (2^omega = omega_n) and there is a function (F:[omega_n]^{< omega}-> omega) such that every finite set can be written at most (2^n-1) ways as the union of two distinct monocolored sets. If GCH…

It is proved that if we partition a $d$-dimensional cube into $n^d$ small cubes and color the small cubes into $m+1$ colors then there exists a monochromatic connected component consisting of at least $f(d, m) n^{d-m}$ small cubes.

We establish two consequences of the Kawamata--Morrison--Totaro cone conjecture, and prove them unconditionally in all dimensions. First, for a K-trivial variety, the natural action of its automorphism group on the set of ample divisor…

In this note, we show how the classical Hodge index theorem implies the Hodge index conjecture of Beilinson for height pairing of homologically trivial codimension two cycles over function field of characteristic 0. Such an index conjecture…

An equitable coloring of a graph $G$ is a proper vertex coloring of $G$ such that the sizes of any two color classes differ by at most one. In the paper, we pose a conjecture that offers a gap-one bound for the smallest number of colors…

We survey some of the mechanisms used to prove that naturally defined sequences in combinatorics are log-concave. Among these mechanisms are Alexandrov's inequality for mixed discriminants, the Alexandrov Fenchel inequality for mixed…

For a K3 surface S, consider the subring of CH(S^n) generated by divisor and diagonal classes (with Q-coefficients). Voisin conjectures that the restriction of the cycle class map to this ring is injective. We prove that Voisin's conjecture…

This simple note lays out a few observations which are well known in many ways but may not have been said in quite this way before. The basic idea is that when comparing two different Markov chains it is useful to couple them is such a way…

The coloring problem is studied in the paper for graph classes defined by two small forbidden induced subgraphs. We prove some sufficient conditions for effective solvability of the problem in such classes. As their corollary we determine…

In this paper we define and present a simple combinatorial formula for a 3-variable Laurent polynomial invariant of conjugacy classes in Artin braid group $B_m$. We show that this Laurent polynomial satisfies the Conway skein relation and…

Combinatorial transgressions are secondary invariants of a space admitting triangulations. They arise from subdivisions and are analogous to transgressive forms such as those arising in Chern-Weil theory. Unlike combinatorial characteristic…

We introduce a new variant of graph coloring called correspondence coloring which generalizes list coloring and allows for reductions previously only possible for ordinary coloring. Using this tool, we prove that excluding cycles of lengths…

The long-standing Erd\H{o}s-Faber-Lov\'asz conjecture states that every $n$-uniform linear hypergaph with $n$ edges has a proper vertex-coloring using $n$ colors. In this paper we propose an algebraic framework to the problem and formulate…