English
Related papers

Related papers: On ubiquity problems in infinite digraphs

200 papers

The uniform one-dimensional fragment U1 is a recently introduced extension of the two-variable fragment FO2. The logic U1 enables the use of relation symbols of all arities and thereby extends the scope of applications of FO2. In this…

Logic · Mathematics 2018-12-21 Jonne Iso-Tuisku , Antti Kuusisto

An out-(in-)branching B_s^+ (B_s^-) rooted at s in a digraph D is a connected spanning subdigraph of D in which every vertex x != s has precisely one arc entering (leaving) it and s has no arcs entering (leaving) it. We settle the…

Combinatorics · Mathematics 2012-03-22 Jørgen Bang-Jensen , Sven Simonsen

We prove the NP-completeness of the integer multiflow problem in planar graphs, with the following restrictions: there are only two demand edges, both lying on the infinite face of the routing graph. This was one of the open challenges…

Discrete Mathematics · Computer Science 2009-11-17 Guyslain Naves

We consider bicolored maps, i.e. graphs which are drawn on surfaces, and construct a bijection between (i) oriented maps with arbitary face structure, and (ii) (weighted) non-oriented maps with exactly one face. Above, each non-oriented map…

Combinatorics · Mathematics 2022-12-12 Agnieszka Czyżewska-Jankowska , Piotr Śniady

We give characterizations of unital uniform topological algebras and saturated locally multiplicatively convex algebras by means of multiplicative linear functionals. Some automatic continuity theorems in advertibly complete uniform…

Functional Analysis · Mathematics 2014-01-03 M. El Azhari

We consider unitary graphs attached to Z_d^n using an analogue of the Euclidean distance. These graphs are shown to be integral when n is odd or the dimension d is even.

Combinatorics · Mathematics 2008-07-17 Si Li , Le Anh Vinh

We prove that if A is a \sigma-unital exact C*-algebra of real rank zero, then every state on K_0(A) is induced by a 2-quasitrace on A. This yields a generalisation of Rainone's work on pure infiniteness and stable finiteness of crossed…

Operator Algebras · Mathematics 2017-05-04 David Pask , Adam Sierakowski , Aidan Sims

Uniform Lie algebras are combinatorially defined two-step nilpotent Lie algebras which can be used to define Einstein solvmanifolds. These Einstein spaces often have nontrivial isotropy groups. We derive basic properties of uniform Lie…

Differential Geometry · Mathematics 2016-03-03 Tracy L. Payne , Matthew Schroeder

Inverse limits, unlike direct limits, can in general be void, [1]. The existence of fixed points for arbitrary mappings $T : X \longrightarrow X$ is conjectured to be equivalent with the fact that related direct limits of all finite…

General Mathematics · Mathematics 2007-09-05 Elemer E Rosinger

An edge uv in a graph \Gamma\ is directionally 2-signed (or, (2,d)-signed) by an ordered pair (a,b), a,b in {+,-}, if the label l(uv) = (a,b) from u to v, and l(vu) = (b,a) from v to u. Directionally 2-signed graphs are equivalent to…

Combinatorics · Mathematics 2016-10-18 E. Sampathkumar , M. A. Sriraj , Thomas Zaslavsky

A digraph is connected-homogeneous if every isomorphism between two finite connected induced subdigraphs extends to an automorphism of the whole digraph. In this paper, we completely classify the countable connected-homogeneous digraphs.

Combinatorics · Mathematics 2013-11-26 Matthias Hamann

It is well known that a graph is bipartite if and only if the spectrum of its adjacency matrix is symmetric. In the present paper, this assertion is dissected into three separate matrix results of wider scope, which are extended also to…

Combinatorics · Mathematics 2016-05-11 V. Nikiforov

The considered problem is uniform convergence of sequences of hypergeometric series. We give necessary and sufficient conditions for uniformly dominated convergence of infinite sums of proper bivariate hypergeometric terms. These conditions…

Classical Analysis and ODEs · Mathematics 2007-05-23 Raimundas Vidunas

A Riemannian orbifold is a mildly singular generalization of a Riemannian manifold that is locally modeled on $R^n$ modulo the action of a finite group. Orbifolds have proven interesting in a variety of settings. Spectral geometers have…

Combinatorics · Mathematics 2019-05-29 Kathleen Daly , Colin Gavin , Gabriel Montes de Oca , Diana Ochoa , Elizabeth Stanhope , Sam Stewart

We show that the categories of directed and undirected reflexive graphs carry exactly two (up to isomorphism) biclosed monoidal structures.

Combinatorics · Mathematics 2025-11-25 Adrien Grenier , Chris Kapulkin

An algebraic proof is presented for the finite strong standard completeness of involutive uninorm logic with fixed point. The result may provide a first step towards settling the open standard completeness problem for involutive uninorm…

Logic · Mathematics 2019-10-04 Sándor Jenei

We prove that every surjective isometry between the unit spheres of two trace class spaces admits a unique extension to a surjective complex linear or conjugate linear isometry between the spaces. This provides a positive solution to…

Functional Analysis · Mathematics 2017-04-11 Francisco J. Fernández-Polo , Jorge J. Garcés , Antonio M. Peralta , Ignacio Villanueva

In this paper, we discuss the existence of fixed points for integral type contractions in uniform spaces endowed with both a graph and an $E$-distance. We also give two sufficient conditions under which the fixed point is unique. Our main…

General Topology · Mathematics 2013-06-03 Aris Aghanians , Kourosh Nourouzi

We show that a continuous map $f$ from a quasi-graph $G$ to itself is pointwise recurrent if and only if one of the following two statements holds: (1) $X$ is a simple closed curve and $f$ is topologically conjugate to an irrational…

Dynamical Systems · Mathematics 2022-11-16 Ziqi Yu , Suhua Wang , Enhui Shi

Given a graph, does there exist an orientation of the edges such that the resulting directed graph is strongly connected? Robbins' theorem [Robbins, Am. Math. Monthly, 1939] states that such an orientation exists if and only if the graph is…

Data Structures and Algorithms · Computer Science 2017-08-25 Anders Aamand , Niklas Hjuler , Jacob Holm , Eva Rotenberg