相关论文: Cobounding odd cycle colorings
Edge-coloring problems with forbidden patterns are decision problems asking to find an edge-coloring of the input graph which avoids a homomorphism from a fixed forbidden family of edge-colored graphs. In the precolored version of these…
In this paper we develop an axiomatic approach to coarse homology theories. We prove a uniqueness result concerning coarse homology theories on the category of `coarse CW-complexes'. This uniqueness result is used to prove a version of the…
We study a generalisation of Vizing's theorem, where the goal is to simultaneously colour the edges of graphs $G_1,\dots,G_k$ with few colours. We obtain asymptotically optimal bounds for the required number of colours in terms of the…
In this paper, we provide an easy proof of the Four-colour Theorem in a special case indeed.
A single coloring channel is defined by a subset of letters it allows to pass through, while deleting all others. A sequence of coloring channels provides multiple views of the same transmitted letter sequence, forming a type of…
An odd graph is a finite graph all of whose vertices have odd degrees. Given graph $G$ is decomposable into $k$ odd subgraphs if its edge set can be partitioned into $k$ subsets each of which induces an odd subgraph of $G$. The minimum…
The paper relates character value of an irreducible representation of a compact connected Lie group at certain elements of finite order with the dimension of a representation on another group, up to some precise constants, which all have…
If the color Coulomb potential is confining, then the Coulomb field energy of an isolated color charge is infinite on an infinite lattice, even if the usual UV divergence is lattice regulated. A simple criterion for Coulomb confinement is…
There are many variations on partition functions for graph homomorphisms or colorings. The case considered here is a counting or hard constraint problem in which the range or color graph carries a free and vertex transitive Abelian group…
We give a short, explicit proof of Hindman's Theorem that in every finite coloring of the integers, there is an infinite set all of whose finite sums have the same color. We give several exampls of colorings of the integers which do not…
We prove that characteristic equations of certain types of delay differential systems, under some mild conditions on their coefficients, can possess infinitely many complex roots.
This paper presents a path to proving the Four-Color Theorem that differs from the traditional "reducible configuration" method. By introducing concepts such as "outer boundary," "primitive set," "Property A," "knot," "valid pair group,"…
We prove a combination theorem for hyperbolic groups, in the case of groups acting on complexes displaying combinatorial features reminiscent of non-positive curvature. Such complexes include for instance weakly systolic complexes and…
We consider the generalization of the P\'olya urn scheme with possibly infinite many colors as introduced in \cite{Th-Thesis, BaTH2014, BaTh2016, BaTh2017}. For countable many colors, we prove almost sure convergence of the urn…
By specializing the parameters in the partition function of the 8VSOS model with domain wall boundary conditions and diagonal reflecting end, we find connections between the three-color model and certain polynomials $p_n(z)$, which are…
We present another proof for the well-known {\em small model property} of two-variable logic. As far as we know, existing proofs of this property rely heavily on model theoretic concepts. In contrast, ours is purely combinatorial and uses…
We prove the Categorified Wrapping Number Conjecture for large classes of annular links, including alternating annular links and tangle closures exhibiting plumbed link phenomena. We do so by characterizing when a resolution is sufficient…
We apply Cauchy's interlacing theorem to derive some eigenvalue bounds to the chromatic number using the normalized Laplacian matrix, including a combinatorial characterization of when equality occurs. Further, we introduce some new…
We develop a word mechanism applied in knot and link diagrams for the illustration of a diagrammatic property. We also give a necessary condition for determining incompressible and pairwise incompressible surfaces, that are embedded in knot…
The pairings between the cyclic cohomologies and the K-theories of separable $C^\ast$-algebras supply topological invariants that often relate to physical response coefficients of materials. Using three numerical simulations, we exemplify…