相关论文: Graphs of multifunctions
We prove the existence of infinite classes of cyclic G-decompositions of the complete multipartite graph, G being a caterpillar, a hairy cycle or a cycle. All the results are obtained by the construction of d-divisible $\alpha$-labelings of…
We show that the independent set sequence of a bipartite graph need not be unimodal.
We propose a unified view of the polarity of functions, that encompasses all specific definitions, generalizes several well-known properties and provides new results. We show that bipolar sets and bipolar functions are isomorphic lattices.…
We give continuity properties of bitraces on (possibly non-commutative) Banach *-algebras based on the Closed Graph Theorem, leading to a simplified proof of the Theorem of Varopoulos in the commutative case.
This document presents a simpler proof showcasing the NP-hardness of Familial Graph Compression.
Graphical functions are single-valued complex functions which arise from Feynman amplitudes. We study their properties and use their connection to multiple polylogarithms to calculate Feynman periods. For the zig-zag and two more families…
This work considers new entropy-based proofs of some known, or otherwise refined, combinatorial bounds for bipartite graphs. These include upper bounds on the number of the independent sets, lower bounds on the minimal number of colors in…
We undertake a general study of multifractal phenomena for functions. We show that the existence of several kinds of multifractal functions can be easily deduced from an abstract statement, leading to new results. This general approach does…
We classify which complete multipartite graphs are intrinsically chiral.
Let $(f, g)$ be a pair of complex analytic functions on a singular analytic space $X$. We give ``the correct'' definition of the relative polar curve of $(f, g)$, and we give a very formal generalization of L\^e's attaching result, which…
The aim of this paper is to present an extension theorem for the functions separately holomorphic on generalized (N,k)-crosses with pluripolar singularities.
The simplification of a multigraph into a simple graph can be abstracted to a more general comma category under some common conditions. When using the identity functor, the category of simple objects in a comma category generalizes the…
The analysis of solutions to algebraic equations is further simplified. A couple of functions and their analytic continuation or root findings are required.
We introduce and prove basic results about several graph-theoretic notions relevant to the multiresolution analysis of flow graphs that represent the transfer of control in computer programs. We take a category-theoretical viewpoint to…
A classification is given of all the countable homogeneous ordered bipartite graphs.
In this work we present a computation paradigm based on a concurrent and incremental construction of proof nets (de-sequentialized or graphical proofs) of the pure multiplicative and additive fragment of Linear Logic, a resources conscious…
Graph-based methods play an important role in unsupervised and semi-supervised learning tasks by taking into account the underlying geometry of the data set. In this paper, we consider a statistical setting for semi-supervised learning and…
Given a graph $G$, a set $T$ of terminal vertices, and a demand graph $H$ on $T$, the \textsc{Multicut} problem asks for a set of edges of minimum weight that separates the pairs of terminals specified by the edges of $H$. The…
The paper is devoted to the development of new sufficient conditions for the calmness and the Aubin property of implicit multifunctions. As the basic tool one employs the directional limiting coderivative which, together with the graphical…
We compute numerically the homology of several graph complexes in low loop orders, extending previous results.