相关论文: On ubiquity problems in infinite digraphs

A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…

In the paper we prove, in particular, that for any measurable coloring of the euclidian plane into two colours there is a monochromatic triangle with some restrictions on the sides. Also we consider similar problems in finite fields…

Reed showed that, if two graphs are $P_4$-isomorphic, then either both are perfect or none of them is. In this note we will derive an analogous result for perfect digraphs.

Mixed graphs can be seen as digraphs with arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case where such graphs are bipartite and in which the undirected and directed degrees are one. The best graphs,…

Nash-Williams' Strong Immersion Conjecture states that graphs are well-quasi-ordered by the strong immersion relation. That is, given infinitely many graphs, one graph contains another graph as a strong immersion. In this paper we study the…

In this paper, we consider a model of classical linear logic based on coherence spaces endowed with a notion of totality. If we restrict ourselves to total objects, each coherence space can be regarded as a uniform space and each linear map…

The incidence matrix of a graph is totally unimodular if and only if the graph is bipartite, i.e., it contains no odd cycles. We extend the characterization of total unimodularity to hypergraphs whose hyperedges of size at least four are…

We present here some conjectures on the diagonalizability of uniform principal bundles on rational homogeneous spaces, that are natural extensions of classical theorems on uniform vector bundles on the projective space, and study the…

We prove a conjecture of Fox, Huang, and Lee that characterizes directed graphs that have constant density in all tournaments: they are disjoint unions of trees that are each constructed in a certain recursive way.

Let A and B be normal matrices with coefficients that are continuous complex-valued functions on a topological space X that has the homotopy type of a CW complex, and suppose these matrices have the same distinct eigenvalues at each point…

We show that a plane continuum X is indecomposable iff X has a sequence (U_n) of not necessarily distinct complementary domains satisfying what we call the double-pass condition: If one draws an open arc A_n in each U_n whose ends limit…

The Unfriendly Partition Problem asks whether it is possible to split the vertex set of an infinite graph $G$ into two parts so that every vertex has at least as many neighbors in the other part than on its own. Despite the uncountable…

It is shown that a separated sequence of points in the unit disc of the complex plane is in fact uniformly separated, if there exists a certain intermediate sequence whose separated subsequences are uniformly separated. This property is…

Let X be a smooth, projective variety defined over a local field K. Following Manin, two K-points of X are called R-equivalent if they can be joined by a rational curve defined over K. The main result of this note shows that if there are…

Checking whether a system of linear equations is consistent is a basic computational problem with ubiquitous applications. When dealing with inconsistent systems, one may seek an assignment that minimizes the number of unsatisfied…

In this paper, we prove the existence of fixed points of mappings satisfying the condition (Da), a kind of generalized nonexpansive mappings, on a weakly compact convex subset in a Banach space satisfying Opial's condition. And we use…

Let S and T be vectors of positive integers with the same sum. We study the uniform distribution on the space of simple bipartite graphs with degree sequence S in one part and T in the other; equivalently, binary matrices with row sums S…

We define pure graphs, invertible graphs, and the notion of complementation of bicoloured graphs. The study of pure graphs is motivated by two conjectures about the transition systems of eulerian graphs and by the Cycle Double Cover…

We prove that for recurrent, reversible graphs, the following conditions are equivalent: (a) existence and uniqueness of the potential kernel, (b) existence and uniqueness of harmonic measure from infinity, (c) a new anchored Harnack…

We prove that there exist rational but not uniformly rational smooth algebraic varieties. The proof is based on computing a certain numerical obstruction developed in the case of compactifications of affine spaces. We show that for some…