Related papers: A Simple Proof of Sharkovsky's Theorem Rerevisited

We prove that if an $n$-vertex graph with minimum degree at least $3$ contains a Hamiltonian cycle, then it contains another cycle of length $n-o(n)$; this implies, in particular, that a well-known conjecture of Sheehan from 1975 holds…

We prove that for all natural numbers $m$ and $k$ where $k$ is odd, there exists a natural number $N(k)$ such that any 3-connected cubic graph with at least $N(k)$ vertices contains a cycle of length $m$ modulo $k$. We also construct a…

By Gromov's mapping theorem for bounded cohomology, the projection of a group to the quotient by an amenable normal subgroup is isometric on group homology with respect to the $\ell^1$-semi-norm. Gromov's description of the diffusion of…

The goal of this article is to prove the comparison theorem between algebraic and topological nearby cycles of a morphism without slopes. We prove in particular that for a family of holomorphic functions without slopes, if we iterate…

The family of cycle completable graphs has several cryptomorphic descriptions, the equivalence of which has heretofore been proven by a laborious implication-cycle that detours through a motivating matrix completion problem. We give a…

We prove that the cycle-valued logarithmic Gromov--Witten theory of a product of simple normal crossings pairs $X\times Y$ decomposes into a product of pieces coming from $X$ and $Y$, provided that the decomposition is considered over a…

The pairings between the cyclic cohomologies and the K-theories of separable $C^\ast$-algebras supply topological invariants that often relate to physical response coefficients of materials. Using three numerical simulations, we exemplify…

We prove new lower bounds on the crossing number of a complete graphs assuming that it is drawn in such a way that it contains a Hamiltonian cycle with no crossings.

We present a proof-theoretical study of the interpretability logic IL, providing a wellfounded and a non-wellfounded sequent calculus for IL. The non-wellfounded calculus is used to establish a cut elimination argument for both calculi. In…

Various results ensure the existence of large complete bipartite graphs in properly colored graphs when some condition related to a topological lower bound on the chromatic number is satisfied. We generalize three theorems of this kind,…

The Law of the Iterated Logarithm for some Markov operators, which converge exponentially to the invariant measure, is established. The operators correspond to iterated function systems which, for example, may be used to generalize the cell…

In this note, we combine ideas of several previous proofs in order to obtain a quite short proof of Gr\"otzsch theorem.

Chudnovsky, Kim, Oum, and Seymour recently established that any prime graph contains one of a short list of induced prime subgraphs [1]. In the present paper we reprove their theorem using many of the same ideas, but with the key…

We generalize Iskovskih's theorem about surfaces without irregularity and bigenus from the smooth case to regular surfaces over arbitrary fields, with special focus on the case of imperfect fields. This includes surfaces that are…

In this paper we explore the design of sequent calculi operating on graphs. For this purpose, we introduce a set of logical connectives allowing us to extend the correspondence between cographs and classical propositional formulas to any…

We conjecture that a 2-connected graph $G$ of order $n$, in which $d(x)+d(y)\geq n-k$ for every pair of non-adjacent vertices $x$ and $y$, contains a cycle of length $n-k$ ($k<n/2$), unless $G$ is bipartite and $n-k$ is odd. This…

It is known that isomorphisms of graph Jacobians induce cyclic bijections on the associated graphs. We characterize when such cyclic bijections can be strengthened to graph isomorphisms, in terms of an easily computed divisor. The result…

Mirsky proved that, for the existence of a complex matrix with given eigenvalues and diagonal entries, the obvious necessary condition is also sufficient. We generalize this theorem to matrices over any field and provide a short proof.…

This paper examines and strengthens the Cuntz-Thomsen picture of equivariant Kasparov theory for arbitrary second-countable locally compact groups, in which elements are given by certain pairs of cocycle representations between C*-dynamical…

We give a very short self-contained combinatorial proof of the Babson-Kozlov conjecture, by presenting a cochain whose coboundary is the desired power of the characteristic class.