相关论文: Graphs of multifunctions
The main result of the paper is motivated by the following two, apparently unrelated graph optimization problems: (A) as an extension of Edmonds' disjoint branchings theorem, characterize digraphs comprising $k$ disjoint branchings $B_i$…
Let $\varphi$ be a function in the complex Sobolev space $W^*(U)$, where $U$ is an open subset in $\mathbb{C}^k$. We show that the complement of the set of Lebesgue points of $\varphi$ is pluripolar. The key ingredient in our approach is to…
Using a recent result of L\'arusson and Poletsky regarding plurisubharmonic subextensions we prove a disc formula for the quasiplurisubharmonic global extremal function for domains in complex projective space. As a corollary we get a…
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…
Let $B$ be a bidirected multigraph with signing $\sigma$, let $X$ be a set of vertices in $B$, and let $k$ be a non-negative integer. For any pair of vertex sets $S,T\subset V(B)$ satisfying $X\cap S = X\cap T$, we denote by $B_{S,T}$ the…
A new layers method is presented for multipartite separability of density matrices from simple graphs. Full separability of tripartite states is studied for graphs on degree symmetric premise. The models are generalized to multipartite…
In this paper, we introduce and study the multilevel-planarity testing problem, which is a generalization of upward planarity and level planarity. Let $G = (V, E)$ be a directed graph and let $\ell: V \to \mathcal P(\mathbb Z)$ be a…
We study the set of all decompositions (clusterings) of a graph through its characterization as a set of lifted multicuts. This leads us to practically relevant insights related to the definition of a class of decompositions by must-join…
In this paper we present another proof of the analytic version of the Hahn-Banach theorem in terms of convex functionals.
The Reduction Map Theorem in H. Tsuji's work on numerical trivial fibrations is corrected and proven. To this purpose various definitions of Tsuji's new intersection numbers for pseudo-effective line bundles equipped with a positive…
Let $D_j\subset\mathbb C^{n_j}$ be a pseudoconvex domain and let $A_j\subset D_j$ be a locally pluriregular set, $j=1,...,N$. Put $$ X:=\bigcup_{j=1}^N A_1\times...\times A_{j-1}\times D_j\times A_{j+1}\times...\times A_N. $$ Let $M\subset…
We prove versions of Rad\'o's theorem for polyanalytic functions in one variable and also on simply connected $\mathbb{C}$-convex domains in $\mathbb{C}^n$. Let $\Omega\subset \mathbb{C}$ be a bounded, simply connected domain and let $q\in…
We give a proof of the openness conjecture of Demailly and Koll\'ar.
A bipartite covering of a (multi)graph $G$ is a collection of bipartite graphs, so that each edge of $G$ belongs to at least one of them. The capacity of the covering is the sum of the numbers of vertices of these bipartite graphs. In this…
We present an algorithm for determining whether a bipartite graph $G$ is 2-chordal (formerly doubly chordal bipartite). At its core this algorithm is an extension of the existing efficient algorithm for determining whether a graph is…
Suppose a finite, unweighted, combinatorial graph $G = (V,E)$ is the union of several (degree-)regular graphs which are then additionally connected with a few additional edges. $G$ will then have only a small number of vertices $v \in V$…
We extend a factorization due to Krein to arbitrary analytic functions from the upper half-plane to itself. The factorization represents every such function as a product of fractional linear factors times a function which, generally, has…
A short proof is given that the graphs with proper interval representations are the same as the graphs with unit interval representations.
One of the most famous results in Complex Analysis is the Little Picard Theorem, that characterizes the image set of an arbitrary entire function. Specifically, the theorem states that this image set is either the whole complex plane or the…
A short and almost elementary proof of the Boros-F\"uredi-B\'ar\'any-Pach-Gromov theorem on the multiplicity of covering by simplices in $\mathbb R^d$ is given.