On universal‐homogeneous hyperbolic graphs and spaces and their isometry groups
Abstract The Urysohn space is the unique separable metric space that is universal and homogeneous for finite metric spaces, that is, it embeds any finite metric space any isometry between finite subspaces extends to an isometry of the whole space. We here consider the existence of a universal‐homogeneous hyperbolic space. We show that for δ>0$\delta >0$
Katrin Tent
wiley +1 more source
Zarankiewicz bounds from distal regularity lemma
Abstract Since Kővári, Sós and Turán proved upper bounds for the Zarankiewicz problem in 1954, much work has been undertaken to improve these bounds, and some have done so by restricting to particular classes of graphs. In 2017, Fox, Pach, Sheffer, Suk and Zahl proved better bounds for semialgebraic binary relations, and this work was extended by Do in
Mervyn Tong
wiley +1 more source
Groups with conjugacy classes of coprime sizes
Abstract Suppose that x$x$, y$y$ are elements of a finite group G$G$ lying in conjugacy classes of coprime sizes. We prove that ⟨xG⟩∩⟨yG⟩$\langle x^G \rangle \cap \langle y^G \rangle$ is an abelian normal subgroup of G$G$ and, as a consequence, that if x$x$ and y$y$ are π$\pi$‐regular elements for some set of primes π$\pi$, then xGyG$x^G y^G$ is a π ...
R. D. Camina +8 more
wiley +1 more source
Diophantine tuples and product sets in shifted powers
Abstract Let k⩾2$k\geqslant 2$ and n≠0$n\ne 0$. A Diophantine tuple with property Dk(n)$D_k(n)$ is a set of positive integers A$A$ such that ab+n$ab+n$ is a k$k$th power for all a,b∈A$a,b\in A$ with a≠b$a\ne b$. Such generalizations of classical Diophantine tuples have been studied extensively.
Ernie Croot, Chi Hoi Yip
wiley +1 more source
Toward heterogeneous information fusion: bipartite graph convolutional networks for in silico drug repurposing. [PDF]
Wang Z, Zhou M, Arnold C.
europepmc +1 more source
Drug-target interaction prediction using semi-bipartite graph model and deep learning. [PDF]
Eslami Manoochehri H, Nourani M.
europepmc +1 more source
In this note we give a combinatorial characterization of all the unmixed bipartite graphs.
openaire +4 more sources
Distributed Integrated Scheduling Algorithm for Identical Two-Workshop Based on the Improved Bipartite Graph. [PDF]
Wei Y, Zhou W, Zhao J, Tan Z, Xie Z.
europepmc +1 more source
Robust Target Association Method with Weighted Bipartite Graph Optimal Matching in Multi-Sensor Fusion. [PDF]
Wu H, Chen W, Chen W.
europepmc +1 more source
BiGvCL: bipartite graph-based cross-domain contrastive learning model for the predicting drug-gene interactions. [PDF]
He S, Wang Z, Li J, Zou Q, Zhang F.
europepmc +1 more source

