English
Related papers

Related papers: Blurred maximal cyclically monotone sets and bipot…

200 papers

We give necessary and sufficient condition for existence and uniqueness of $\mathbb{L}^{p}$-solutions of reflected BSDEs with continuous barrier, generator monotone with respect to $y$ and Lipschitz continuous with respect to $z$, and with…

Probability · Mathematics 2018-10-09 Tomasz Klimsiak

We provide a new proof that the subdifferential of a proper lower semicontinuous convex function on a Banach space is maximal monotone by adapting the pattern commonly used in the Hilbert setting. We then extend the arguments to show more…

Optimization and Control · Mathematics 2013-06-25 Marc Lassonde

In this paper, we give a lengthy proof of a small result! A graph is bisplit if its vertex set can be partitioned into three stable sets with two of them inducing a complete bipartite graph. We prove that these graphs satisfy the…

Discrete Mathematics · Computer Science 2023-06-22 Laurent Beaudou , Giacomo Kahn , Matthieu Rosenfeld

We give a fully polynomial randomized approximation scheme to compute a lower bound for the matching polynomial of any weighted graph at a positive argument. For the matching polynomial of complete bipartite graphs with bounded weights…

Computational Complexity · Computer Science 2007-05-23 Shmuel Friedland

We study two variations of the Gyarfas--Lehel conjecture on the minimum number of monochromatic components needed to cover an edge-coloured complete bipartite graph. Specifically, we show the following. - For p>> (\log n/n)^{1/2},…

Combinatorics · Mathematics 2024-03-20 Camila Fernández , Matías Pavez-Signé , Maya Stein

In this paper, motivated by a question posed in \cite{AH}, we introduce strongly biconvex graphs as a subclass of weakly chordal and bipartite graphs. We give a linear time algorithm to find an induced matching for such graphs and we prove…

Commutative Algebra · Mathematics 2019-05-08 Sara Saeedi Madani , Dariush Kiani

We give necessary and sufficient conditions for a Lagrangian submanifold of a K\"ahler manifold to be biharmonic. Furthermore, we classify biharmonic PNMC Lagrangian submanifolds in the complex space forms.

Differential Geometry · Mathematics 2012-04-10 Shun Maeta , Hajime Urakawa

We consider a complete biharmonic immersed submanifold $M$ in an Euclidean space $\mathbb{E}^N$. Assume that the immersion is proper, that is, the preimage of every compact set in $\mathbb{E}^N$ is also compact in $M$. Then, we prove that…

Differential Geometry · Mathematics 2012-08-22 Kazuo Akutagawa , Shun Maeta

We consider a non-negative biminimal properly immersed submanifold $M$ (that is, a biminimal properly immersed submanifold with $\lambda\geq0$) in a complete Riemannian manifold $N$ with non-positive sectional curvature. Assume that the…

Differential Geometry · Mathematics 2012-11-01 Shun Maeta

Given an $n$-vertex pseudorandom graph $G$ and an $n$-vertex graph $H$ with maximum degree at most two, we wish to find a copy of $H$ in $G$, i.e.\ an embedding $\varphi\colon V(H)\to V(G)$ so that $\varphi(u)\varphi(v)\in E(G)$ for all…

Combinatorics · Mathematics 2023-04-06 Jie Han , Yoshiharu Kohayakawa , Patrick Morris , Yury Person

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…

Combinatorics · Mathematics 2024-12-10 Marzieh Eidi , Sayan Mukherjee

We present different extensions of the Banach contraction principle in the $G$-metric space setting. More precisely, we consider mappings for which the contractive condition is satisfied by a power of the mapping and for which the power…

General Topology · Mathematics 2017-04-04 Yaé Olatoundji Gaba

We define strongly chordal digraphs, which generalize strongly chordal graphs and chordal bipartite graphs, and are included in the class of chordal digraphs. They correspond to square 0,1 matrices that admit a simultaneous row and column…

Combinatorics · Mathematics 2019-11-14 Pavol Hell , Cesar Hernandez-Cruz , Jing Huang , Jephian C. -H. Lin

In this paper we settle in the negative the problem of the superreflexivity of Garling sequence spaces by showing that they contain a complemented subspace isomorphic to a non superreflexive mixed-norm sequence space. As a by-product of our…

Functional Analysis · Mathematics 2018-09-11 Fernando Albiac , Jose L. Ansorena , Stephen J. Dilworth , Denka Kutzarova

This paper proposes an efficient method to construct the bipartite graph with as many edges as possible while without introducing the shortest cycles of length equal to 4. The binary matrix associated with the bipartite graph described…

Information Theory · Computer Science 2014-04-22 Weizhi Lu , Kidiyo Kpalma , Joseph Ronsin

For a directed acyclic graph, there are two known criteria to decide whether any specific conditional independence statement is implied for all distributions factorized according to the given graph. Both criteria are based on special types…

Statistics Theory · Mathematics 2009-04-03 Giovanni M. Marchetti , Nanny Wermuth

The permanental polynomial of a graph $G$ is $\pi(G,x)\triangleq\mathrm{per}(xI-A(G))$. From the result that a bipartite graph $G$ admits an orientation $G^e$ such that every cycle is oddly oriented if and only if it contains no even…

Combinatorics · Mathematics 2010-10-07 Heping Zhang , Wei Li

mim-width is a recent graph width measure that has seen applications in graph algorithms and problems related to propositional satisfiability. In this paper, we show linear lower bounds for the mim-width of strongly chordal split graphs,…

Discrete Mathematics · Computer Science 2017-01-05 Stefan Mengel

In this paper, a sufficient condition for the existence of hyperinvariant subspace of compact perturbations of multiplication operators on some Banach spaces is presented. An interpretation of this result for compact perturbations of normal…

Functional Analysis · Mathematics 2014-04-07 Hubert Klaja

The boxicity of a graph G is defined as the minimum integer k such that G is an intersection graph of axis-parallel k-dimensional boxes. Chordal bipartite graphs are bipartite graphs that do not contain an induced cycle of length greater…

Combinatorics · Mathematics 2009-06-04 L. Sunil Chandran , Mathew C. Francis , Rogers Mathew