相关论文: A simple proof of orientability in colored group f…

Each of several possible definitions of local injectivity for a homomorphism of an oriented graph $G$ to an oriented graph $H$ leads to an injective oriented colouring problem. For each case in which such a problem is solvable in polynomial…

While planar graphs are flat from a topological viewpoint, we observe that they are not from a geometric one. We prove that every planar graph can be embedded into a surface consisting of spheres, glued together in a tree-like fashion. As a…

In this paper we study threshold coloring of graphs, where the vertex colors represented by integers are used to describe any spanning subgraph of the given graph as follows. Pairs of vertices with near colors imply the edge between them is…

An embedding of a graph on an orientable surface is orientably-regular (or rotary, in an equivalent terminology) if the group of orientation-preserving automorphisms of the embedding is transitive (and hence regular) on incident vertex-edge…

The Rayleigh monotonicity is a principle from the theory of electrical networks. Its combinatorial interpretation says for each two edges of a graph G, that the presence of one of them in a random spanning tree of G is negatively correlated…

It has been conjectured that if a finite graph has a vertex coloring such that the union of any two color classes induces a connected graph, then for every set $T$ of vertices containing exactly one member from each color class there exists…

In this paper, we study orthogonal colourings of random geometric graphs. Two colourings of a graph are orthogonal if they have the property that when two vertices receive the same colour in one colouring, then those vertices receive…

Bipartite graphs are a fundamental concept in graph theory with diverse applications. A graph is bipartite iff it contains no odd cycles, a characteristic that has many implications in diverse fields ranging from matching problems to the…

We prove a compactness theorem for holomorphic curves in 4-dimensional symplectizations that have embedded projections to the underlying 3-manifold. It strengthens the cylindrical case of the SFT compactness theorem by using intersection…

We prove the existence of a finite set of moves sufficient to relate any two representations of the same 3-manifold as a 4-fold simple branched covering of S^3. We also prove a stabilization result: after adding a fifth trivial sheet two…

This work concerns results on conditions guaranteeing that certain banded $M$-matrices have banded inverses. As a first goal, a graph theoretic characterization for an off-diagonal entry of the inverse of an $M$-matrix to be positive, is…

Group field theories are a generalization of matrix models which provide both a second quantized reformulation of loop quantum gravity as well as generating functions for spin foam models. While states in canonical loop quantum gravity, in…

We construct a colored operad whose category of algebras is the category of algebraic quantum field theories. This is achieved by a construction that depends on the choice of a category, whose objects provide the operad colors, equipped…

Consider edge colorings of digraphs where edges $v_1 v_2$ and $v_2 v_3$ have different colors. This coloring induces a vertex coloring by sets of edge colors, in which edge $v_1 v_2$ in the graph implies that the set color of $v_1$ contains…

A graph G is list (b:a)-colorable if for every assignment of lists of size b to vertices of G, there exists a choice of an a-element subset of the list at each vertex such that the subsets chosen at adjacent vertices are disjoint. We prove…

In this article, we study feature attributions of Machine Learning (ML) models originating from linear game values and coalitional values defined as operators on appropriate functional spaces. The main focus is on random games based on the…

The foldings of a connected graph $G$ are defined as follows. First, $G$ is a folding of itself. Let $G'$ be a graph obtained from $G$ by identifying two vertices at distance 2 in $G$. Then every folding of $G'$ is a folding of $G$. The…

A theorem of Kontsevich relates the homology of certain infinite dimensional Lie algebras to graph homology. We formulate this theorem using the language of reversible operads and mated species. All ideas are explained using a pictorial…

Both the intensity distribution and the degree of coherence between pairs of points along the propagation axis (z-coherence) are derived in closed form for a phenomenon of self-focusing produced by circularly coherent light. The first…

The divergence theorem in its usual form applies only to suitably smooth vector fields. For vector fields which are merely piecewise smooth, as is natural at a boundary between regions with different physical properties, one must patch…