2000 character limit reached
Simple proofs of estimations of Ramsey numbers and of discrepancy (2107.13831v2)
Published 29 Jul 2021 in math.CO, cs.DM, and math.HO
Abstract: In this expository note we present simple proofs of the lower bound of Ramsey numbers (Erd\"os theorem), and of the estimation of discrepancy. Neither statements nor proofs require any knowledge beyond high-school curriculum (except a minor detail). Thus they are accessible to non-specialists, in particular, to students. Our exposition is simpler than the standard exposition because no probabilistic language is used. In order to prove the existence of a good' object we prove that the number of
bad' objects is smaller than the number of all objects.