相关论文: Graph coloring manifolds

It is known that knot homologies admit a physical description as spaces of open BPS states. We study operators and algebras acting on these spaces. This leads to a very rich story, which involves wall crossing phenomena, algebras of closed…

We compute numerically the homology of several graph complexes in low loop orders, extending previous results.

The class of special generic maps contains Morse functions with exactly two singular points, characterizing spheres topologically which are not $4$-dimensional and the $4$-dimensional unit sphere. This class is for higher dimensional…

In the present paper we study hyperbolic manifolds that are rational homology 3-spheres obtained by colouring of right--angled polytopes. We study the existence (or absence) of different kinds of symmetries of rational homology spheres that…

The aim of this paper is to introduce Hom-Novikov color algebras and give some constructions of Hom-Novikov color algebras from a given one and a (weak) morphism. Other interesting constructions using averaging operators, centroids,…

A homomorphism from a graph $X$ to a graph $Y$ is an adjacency preserving mapping $f:V(X) \rightarrow V(Y)$. We consider a nonlocal game in which Alice and Bob are trying to convince a verifier with certainty that a graph $X$ admits a…

In this paper, a theorem is proved that generalizes several existing amalgamation results in various ways. The main aim is to disentangle a given edge-colored amalgamated graph so that the result is a graph in which the edges are shared out…

A graph embedded in a surface with all faces of size 4 is known as a quadrangulation. We extend the definition of quadrangulation to higher dimensions, and prove that any graph G which embeds as a quadrangulation in the real projective…

We define a new variant of Rabinowitz Floer homology that is particularly well suited to studying the growth rate of leaf-wise intersections. We prove that for closed manifolds $M$ whose loop space is "complicated", if $\Sigma$ is a…

We produce an edge-coloring of the complete 3-uniform hypergraph on n vertices with $e^{O(\sqrt {log log n})}$ colors such that the edges spanned by every set of five vertices receive at least three distinct colors. This answers the first…

The Colouring problem asks whether the vertices of a graph can be coloured with at most $k$ colours for a given integer $k$ in such a way that no two adjacent vertices receive the same colour. A graph is $(H_1,H_2)$-free if it has no…

We propose a new approach for defining and searching clusters in graphs that represent real technological or transaction networks. In contrast to the standard way of finding dense parts of a graph, we concentrate on the structure of edges…

We study a graph coloring problem motivated by a fun Sudoku-style puzzle. Given a bipartition of the edges of a graph into {\em near} and {\em far} sets and an integer threshold $t$, a {\em threshold-coloring} of the graph is an assignment…

We construct noncomplex smooth 4-manifolds which admit genus-2 Lefschetz fibrations over S^2. The fibrations are necessarily hyperelliptic, and the resulting 4-manifolds are not even homotopy equivalent to complex surfaces. Furthermore,…

In this paper, we study the homology of the coloring complex and the cyclic coloring complex of a complete $k$-uniform hypergraph. We show that the coloring complex of a complete $k$-uniform hypergraph is shellable, and we determine the…

We prove lower and upper bounds for the chromatic number of certain hypergraphs defined by geometric regions. This problem has close relations to conflict-free colorings. One of the most interesting type of regions to consider for this…

Graph colouring is a combinatorial optimisation problem with applications in several important domains, including sports scheduling, cartography, street map navigation, and timetabling. It is also of significant theoretical interest and a…

Higher-rank graphs are, as the name suggests, higher-dimensional analogues of directed graphs which we will define using category theory. The whole idea of my project was to construct what we call a Baumslag-Solitar graph, a higher-rank…

We show that every irreducible toroidal integer homology sphere graph manifold has a left-orderable fundamental group. This is established by way of a specialization of a result due to Bludov and Glass for the almagamated products that…

Symplectic 4-manifolds $(X,\omega)$ with $b_+{=}1$ are roughly classified by the canonical class $K$ and the symplectic form $\omega$ depending upon the sign of $K^2$ and $K\cdot \omega$. Examples are known for each category except for the…