Related papers: A Simple Proof of Sharkovsky's Theorem

In this note, we present a simple non-directed graph proof of Sharkovsky's theorem which is different from the one given in [2].

Recently we have obtained two simple proofs of Sharkovsky's theorem, one with directed graphs [7] and the other without [8]. In this note, we present yet more simple proofs of Sharkovsky's theorem.

Based on various strategies and a new general doubling operator, we obtain several simple proofs of the celebrated Sharkovsky's cycle coexistence theorem. A simple non-directed graph proof which is especially suitable for a calculus course…

Based on various strategies, we obtain several simple proofs of the celebrated Sharkovsky cycle coexistence theorem.

The original proof of the Sharkovsky theorem is presented in full detail. The proof should be accessible to readers with basic Real Analysis background. Although nowadays there are several alternative proofs of this classical result, we…

The purpose of this note is to rephrase Speyer's elegant topological proof for Kasteleyn's Theorem in a simple graph theoretical manner.

We give a simple short proof of Brooks' theorem using only induction and greedy coloring, while avoiding issues of graph connectivity. The argument generalizes easily to some extensions of Brooks' theorem, including its variants for list…

We present an elementary proof of a generalization of Kirchoff's matrix tree theorem to directed, weighted graphs. The proof is based on a specific factorization of the Laplacian matrices associated to the graphs, which only involves the…

We provide a simple proof of Kamp's theorem.

We give a very simple proof of a strengthened version of Chernoff's Inequality. We derive the same conclusion from much weaker assumptions.

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

I present a simple, elementary proof of Morley's theorem, highlighting the naturalness of this theorem.

We present simple and direct proof to an important case of Nash-Moser-Ekeland theorem.

This paper is purely expositional. The statement of the Kuratowski graph planarity criterion is simple and well-known. However, its classical proof is not easy. In this paper we present the Makarychev proof (with further simplifications by…

The aim of this short note is to present an elementary, self-contained, and direct proof for the classical Lebesgue decomposition theorem.

We give a remarkably elementary proof of the Brouwer fixed point theorem. The proof is verifiable for most of the mathematicians.

In this note we introduce a representation of simple undirected graphs in terms of polynomials and obtain a unique code for a simple undirected graph.

A proof of Sendov's conjecture is given.

We give a simple direct proof of Fermat's two squares theorem. Our argument uses no intricate notions or ideas; one might say that it is a proof by careful bookkeeping. As such, the proof may be particularly easy to comprehend by students…

In this paper, we provide an easy proof of the Four-colour Theorem in a special case indeed.