相关论文: Cobounding odd cycle colorings
The Razumov-Stroganov conjecture relates the ground-state coefficients in the even-length dense O(1) loop model to the enumeration of fully-packed loop configuration on the square, with alternating boundary conditions, refined according to…
Our purpose is to show that complements of line graphs enjoy nice coloring properties. We show that for all graphs in this class the local and usual chromatic numbers are equal. We also prove a sufficient condition for the chromatic number…
This article introduces a natural extension of colouring numbers of knots, called colouring polynomials, and studies their relationship to Yang-Baxter invariants and quandle 2-cocycle invariants. For a knot K in the 3-sphere let \pi_K be…
The Abu-Khzam--Langston conjecture, that is the weak-immersion analogue of Hadwiger's conjecture and a weak version of an earlier conjecture of Lescure and Meyniel, asserts that every graph $G$ contains a weak immersion of $K_{\chi(G)}$. We…
An excluded minor characterization for the class of binary signed-graphic matroids with graphic cocircuits is provided. In this report we present the necessary computations for the case analysis in the proof.
We give a simple short proof of Brooks' theorem using only induction and greedy coloring, while avoiding issues of graph connectivity. The argument generalizes easily to some extensions of Brooks' theorem, including its variants for list…
An argument is given which exhibits color confinement in nonabelian gauge theory.
We show that the threshold for having a rainbow copy of a power of a Hamilton cycle in a randomly edge colored copy of $G_{n,p}$ is within a constant factor of the uncolored threshold. Our proof requires $(1+\varepsilon)$ times the minimum…
We define a $P$-compelling coloring as a proper coloring of the vertices of a graph such that every subset consisting of one vertex of each color has property $P$. The $P$-compelling chromatic number is the minimum number of colors in such…
A model named `Colored Percolation' has been introduced with its infinite number of versions in two dimensions. The sites of a regular lattice are randomly occupied with probability $p$ and are then colored by one of the $n$ distinct colors…
A $(d-1)$-dimensional simplicial complex is called balanced if its underlying graph admits a proper $d$-coloring. We show that many well-known face enumeration results have natural balanced analogs (or at least conjectural analogs).…
An odd coloring of a graph is a proper coloring such that every non-isolated vertex has a color that appears at an odd number of its neighbors. This notion was introduced by Petr\v{s}evski and \v{S}krekovski in 2022. In this paper, we focus…
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,…
A mixing Markov chain is proved to be realized as a random walk in a directed graph subject to a synchronizing road coloring. The result ensures existence of appropriate random mappings in Propp--Wilson's coupling from the past. The proof…
We determine the algebra structure of the Hochschild cohomology of the singular cochain algebra with coefficients in a field on a space whose cohomology is a polynomial algebra. A spectral sequence calculation of the Hochschild cohomology…
We prove positivity results about linearization and connection coefficients for Bessel polynomials. The proof is based on a recursion formula and explicit formulas for the coefficients in special cases. The result implies that the…
Hoffman's bound is a well-known eigenvalue bound on the chromatic number of a graph. By interpreting this bound as a parameter, we show multiple applications of colorings attaining the bound (Hoffman colorings) for several notions of graph…
Group cohomology of polynomial growth is defined for any finitely generated discrete group, using cochains that have polynomial growth with respect to the word length function. We give a geometric condition that guarantees that it agrees…
We study combinatorial modulus on boundaries of hyperbolic Coxeter groups. We give new examples of hyperbolic groups whose boundary satisfies a combinatorial version of the Loewner property, and prove Cannon's conjecture for Coxeter groups.…
We propose a modified BCS wavefunction as the ground state of a correlated superconductor with the correlation specified between $k$ and $-k$ electrons in the reciprocal space. Owing to this correlation, low-energy excitations are not…