Related papers: Colored Tverberg problem, extensions and new resul…
An $r$-uniform hypergraph $H = (V, E)$ is $r$-partite if there exists a partition of the vertex set into $r$ parts such that each edge contains exactly one vertex from each part. We say an independent set in such a hypergraph is balanced if…
We establish a connection between root multiplicities for Borcherds-Kac-Moody algebras and graph coloring. We show that the generalized chromatic polynomial of the graph associated to a given Borcherds algebra can be used to give a closed…
There are several famous unsolved conjectures about the chromatic number that were relaxed and already proven to hold for the fractional chromatic number. We discuss similar relaxations for the topological lower bound(s) of the chromatic…
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…
For the four-color theorem that has been developed over one and half centuries, all people believe it right but without complete proof convincing all1-3. Former proofs are to find the basic four-colorable patterns on a planar graph to…
We prove an effective version of the inverse theorem for the Gowers $U^3$-norm for functions supported on high-rank quadratic level sets in finite vector spaces. For configurations controlled by the $U^3$-norm (complexity-two…
We study the resonant prescribed T-curvature problem on a compact 4-dimensional Riemannian manifold with boundary. We derive sharp energy and gradient estimates of the associated Euler-Lagrange functional to characterize the critical points…
We establish the twisted crystallographic T-duality, which is an isomorphism between Freed-Moore twisted equivariant K-groups of the position and momentum tori associated to an extension of a crystallographic group. The proof is given by…
In this notes it will be provided a set of techniques which can help one to understand the proof of the Hochschild-Kostant-Rosenberg theorem for differentiable manifolds. Precise definitions of multidiferential operators and polyderivations…
The theory of colorful graphs can be developed by working in Galois field modulo (p), p > 2 and a prime number. The paper proposes a program of possible conversion of graph theory into a pleasant colorful appearance. We propose to paint the…
In this paper we prove Morse index theorems for a big class of constrained variational problems on graphs. Such theorems are useful in various physical and geometric applications. Our formulas compute the difference of Morse indices of two…
Using the tools of algebraic Morse theory, and the thin poset approach to constructing homology theories, we give a categorification of Whitney's broken circuit theorem for the chromatic polynomial, and for Stanley's chromatic symmetric…
Colored tensor models (CTM) is a random geometrical approach to quantum gravity. We scrutinize the structure of the connected correlation functions of general CTM-interactions and organize them by boundaries of Feynman graphs. For rank-$D$…
The representation is essentially the same as that given by J.P.Nagle in J. Comb. Theory (B), 1971, 10:1, 42--59. The distinction is in the definition of the weighting function via the number of flows. This new definition allows one to…
We give a short introduction to the theory of twisted Alexander polynomials of a 3--manifold associated to a representation of its fundamental group. We summarize their formal properties and we explain their relationship to twisted…
A rough structure theorem is proved for graphs $G$ containing no copy of a bounded degree tree $T$: from any such $G$, one can delete $o(|G||T|)$ edges in order to get a subgraph all of whose connected components have a cover of order…
In this article we consider certain well-known polynomials associated with graphs including the independence polynomial and the chromatic polynomial. These polynomials count certain objects in graphs: independent sets in the case of the…
In this paper, we proved two results regarding the arithmetics of separably $\mathbb{A}^1$-connected varieties of rank one. First we proved over a large field, there is an $\mathbb{A}^1$-curve through any rational point of the boundary, if…
The list coloring problem is a variation of the classical vertex coloring problem, extensively studied in recent years, where each vertex has a restricted list of allowed colors, and having some variations as the $(\gamma,\mu)$-coloring,…
We start by building up some theory to state Wagner's Theorem, and then prove it using Kuratowski's Theorem, a proof of which is found in Diester (2000). Following this, we establish some connections between the chromatic number of a graph…