相关论文: Almost resolvable even cycle systems of $(K_u \tim…

Given a directed graph, we show how to efficiently find a shortest (directed, simple) cycle on an even number of vertices. As far as we know, no polynomial-time algorithm was previously known for this problem. In fact, finding any even…

In this paper a review is given of a class of sub-models of both approaches, characterized by the fact that they can be solved exactly, highlighting in the process a number of generic results related to both the nature of pair-correlated…

We consider one dimensional chains of interacting particles subjected to one dimensional almost-periodic media. We formulate and prove two KAM type theorems corresponding to both short-range and long-range interactions respectively. Both…

A theorem on the existence of exactly $N$ limit cycles around a critical point for the Lienard system $\ddot{x}+f(x) \dot{x}+g(x) =0$ is proved. An alogrithm on the determination of a desired number of limit cycles for this system has been…

We obtain sharp bounds for the number of n--cycles in a finite graph as a function of the number of edges, and prove that the complete graph is optimal in more ways than could be imagined. We prove sharp estimates on both the sum of k-th…

Chen, Faudree, Gould, Jacobson, and Lesniak determined the minimum degree threshold for which a balanced $k$-partite graph has a Hamiltonian cycle. We give an asymptotically tight minimum degree condition for Hamiltonian cycles in arbitrary…

In this paper, we consider the problem of finding a cycle of length $2k$ (a $C_{2k}$) in an undirected graph $G$ with $n$ nodes and $m$ edges for constant $k\ge2$. A classic result by Bondy and Simonovits [J.Comb.Th.'74] implies that if $m…

Partial cubes are graphs that can be isometrically embedded into hypercubes. Convex cycles play an important role in the study of partial cubes. In this paper, we prove that a regular partial cube is a hypercube (resp., a Doubled Odd graph,…

Approximate agreement is one of the few variants of consensus that can be solved in a wait-free manner in asynchronous systems where processes communicate by reading and writing to shared memory. In this work, we consider a natural…

We prove the almost sure invariance principle for stationary R^d--valued processes (with dimension-independent very precise error terms), solely under a strong assumption on the characteristic functions of these processes. This assumption…

Let G denote a graph and let K be a subset of vertices that are a set of target vertices of G. The K-terminal reliability of G is defined as the probability that all target vertices in K are connected, considering the possible failures of…

Many examples of exactly solvable birth and death processes, a typical stationary Markov chain, are presented together with the explicit expressions of the transition probabilities. They are derived by similarity transforming exactly…

We construct uncountably many mutually nonisomorphic simple separable stably finite unital exact C$^\ast$-algebras which are not isomorphic to their opposite algebras. In particular, we prove that there are uncountably many possibilities…

We study the k-route cut problem: given an undirected edge-weighted graph G=(V,E), a collection {(s_1,t_1),(s_2,t_2),...,(s_r,t_r)} of source-sink pairs, and an integer connectivity requirement k, the goal is to find a minimum-weight subset…

By introducing a notion of smooth connection for unbounded $KK$-cycles, we show that the Kasparov product of such cycles can be defined directly, by an algebraic formula. In order to achieve this it is necessary to develop a framework of…

We establish the tracial stability of a certain class of graph products of C*-algebras. This result involves the development of the "pincushion class" of finite graphs. We then apply this result in two ways. The first application yields a…

Erd\"os conjectured that if $G$ is a triangle free graph of chromatic number at least $k\geq 3$, then it contains an odd cycle of length at least $k^{2-o(1)}$ \cite{sudakovverstraete, verstraete}. Nothing better than a linear bound…

An Orthogonally resolvable Matching Design OMD$(n, k)$ is a partition of the edges the complete graph $K_n$ into matchings of size $k$, called blocks, such that the blocks can be resolved in two different ways. Such a design can be…

We prove the existence of small amplitude, time-quasi-periodic solutions (invariant tori) for the incompressible Navier-Stokes equation on the $d$-dimensional torus $\T^d$, with a small, quasi-periodic in time external force. We also show…

For any $k\ge 3$ and $\ell \in [k-1]$ such that $(k,\ell) \ne (3,1)$, we show that any sufficiently large $k$-graph $G$ must contain a Hamilton $\ell$-cycle provided that it has no isolated vertices and every set of $k-1$ vertices contained…