相关论文: Soft Barycentric Refinement

In our world the standard model of particle physics contains within it the fairly intractable theory called QCD. A toy version with two colours is often studied as a model confining and chiral symmetry breaking field theory. Here we…

A vertex coloring of a graph $G$ is called a 2-distance coloring if any two vertices at a distance at most $2$ from each other receive different colors. Suppose that $G$ is a planar graph with girth $5$ and maximum degree $\Delta$. We prove…

A self-dual harmonic 2-form on a 4-dimensional Riemannian manifold is symplectic where it does not vanish. Furthermore, away from the form's zero set, the metric with the 2-form give a compatible almost complex structure and thus…

A graph is $(c_1, c_2, ..., c_k)$-colorable if the vertex set can be partitioned into $k$ sets $V_1,V_2, ..., V_k$, such that for every $i: 1\leq i\leq k$ the subgraph $G[V_i]$ has maximum degree at most $c_i$. We show that every planar…

In this paper, we consider a weighted generalization of the chromatic number of a Binomial random graph~\(G.\) We equip each edge with a random weight and then colour the vertices in such a way that the absolute colour difference between…

We prove that if an asymptotically Schwarzschildean 3-manifold (M,g) contains a properly embedded stable minimal surface, then it is isometric to the Euclidean space. This implies, for instance, that in presence of a positive ADM mass any…

The paper deals with extremal problems concerning colorings of hypergraphs. By using a random recoloring algorithm we show that any $n$-uniform simple (i.e. every two distinct edges share at most one vertex) hypergraph $H$ with maximum edge…

We propose an open question that seeks to generalise the Four Colour Theorem from two to three dimensions. As an appetiser, we show that 12 instead of four colours are both sufficient and necessary to colour every 2-complex that embeds in a…

Given a graph G, a colouring is an assignment of colours to the vertices of G so that no two adjacent vertices are coloured the same. If all colour classes have size at most t, then we call the colouring t-bounded, and the t-bounded…

We study the confining properties of QCD with two colors across the finite density phase transition. A disorder parameter detecting dual superconductivity of the QCD vacuum is used as a probe for the confinement/deconfinement phase…

A recent result of Chepoi, Estellon and Vaxes [DCG '07] states that any planar graph of diameter at most 2R can be covered by a constant number of balls of size R; put another way, there are a constant-sized subset of vertices within which…

A strong edge-coloring of a graph $G$ is an edge-coloring in which every color class is an induced matching, and the strong chromatic index $\chi_s'(G)$ is the minimum number of colors needed in strong edge-colorings of $G$. A graph is…

The spectrum of the Laplacian of successive Barycentric subdivisions of a graph converges exponentially fast to a limit which only depends on the clique number of the initial graph and not on the graph itself. The proof uses an explicit…

The chromatic polynomial and its generalization, the chromatic symmetric function, are two important graph invariants. Celebrated theorems of Birkhoff, Whitney, and Stanley show how both objects can be expressed in three different ways: as…

We investigate slicings of combinatorial manifolds as properly embedded co-dimension 1 submanifolds. A focus is given to dimension 3 where slicings are normal surfaces. In the case of 2-neighborly 3-manifolds and quadrangulated slicings, a…

Einstein-Maxwell theory is not only covariant under diffeomorphisms but also is under $U(1)$ gauge transformations. We introduce a combined transformation constructed out of diffeomorphism and $U(1)$ gauge transformation. We show that…

We conclude an investigation of Abrishami, Esperet, Giocanti, Hamman, Knappe and M\"oller studying the existence of periodic colourings of locally finite graphs. A colouring of a graph $\Gamma$ is periodic if the resulting coloured graph…

The Goldberg-Sachs theorem is generalized for all four-dimensional manifolds endowed with torsion-free connection compatible with the metric, the treatment includes all signatures as well as complex manifolds. It is shown that when the Weyl…

Let $F$ be the field of $q$ elements. We investigate the following Ramsey coloring problem for vector spaces: Given a vector space $\F^n$, give a coloring of the points of $F^n$ with two colors such that no affine line (i.e., affine…

All spherically symmetric Riemannian metrics of constant scalar curvature in any dimension can be written down in a simple form using areal coordinates. All spherical metrics are conformally flat, so we search for the conformally flat…