• Title Introduction to Ramsey Theory
• Author(s) Veselin Jungic
• Publisher:Simon Fraser University; eBook (Creative Commons Licensed)
• License(s): Creative Commons License (CC)
• Hardcover/Paperback: 238 pages
• eBook: HTML
• Language: English
• ISBN-10: 1032260378
• ISBN-13: 978-1032260372
• Share This:  

Book Description

This book serves as a gentle introduction to Ramsey Theory for readers interested in becoming familiar with a dynamic segment of contemporary mathematics that combines ideas from number theory and combinatorics.

• Dr. Veselin Jungić is a Teaching Professor at the Department of Mathematics, Simon Fraser University, Burnaby, British Columbia, Canada.

• Amazon

• Combinatorics
• Number Theory
• Graph Theory
• Discrete and Finite Mathematics

• Introduction to Ramsey Theory (Veselin Jungic)
• The Mirror Site (1) - PDF
• The Mirror Site (2) - PDF
• Ramsey Theory: Yesterday, Today, and Tomorrow (Alexander Soifer)

• Combinatorics Through Guided Discovery (Kenneth P. Bogart)

  This book is an introduction to combinatorial mathematics, also known as combinatorics. The book focuses especially but not exclusively on the part of combinatorics that mathematicians refer to as 'counting'.

• Applied Combinatorics (Mitchel T. Keller, et al)

  This is a text with more than enough material for a one-semester introduction to combinatorics. The original target audience was primarily computer science majors, but the topics included make it suitable for a variety of different students.

• Analytic Combinatorics (Philippe Flajolet, et al)

  The definitive treatment of analytic combinatorics. This self-contained text covers the mathematics underlying the analysis of discrete structures, with thorough treatment of a large number of applications.

• An Introduction to Combinatorics and Graph Theory

  This book walks the reader through the classic parts of Combinatorics and graph theory, while also discussing some recent progress in the area: on the one hand, providing material that will help students learn the basic techniques.

• Foundations of Combinatorics with Applications (Edward Bender)

  This introduction to combinatorics, the foundation of the interaction between computer science and mathematics, is suitable for upper-level undergraduates and graduate students in engineering, science, and mathematics.

• Lists, Decisions and Graphs - With an Introduction to Probability

  In this book, four basic areas of discrete mathematics are presented: Counting and Listing (Unit CL), Functions (Unit Fn), Decision Trees and Recursion (Unit DT), and Basic Concepts in Graph Theory (Unit GT).

• Magic Squares and Cubes (William Symes Andrews)

  This book cover topics such as magic squares, magic cubes, the Franklin squares, magics and Pythagorean numbers, the theory of reversions, magic circles, spheres, and stars, and magic octahedroids, among other things.

• Combinatorial Geometry with Application to Field Theory

  Topics covered in this book include fundamental of combinatorics, algebraic combinatorics, topology with Smarandache geometry, combinatorial differential geometry, combinatorial Riemannian submanifolds, Lie multi-groups, etc.

• A=B, by Marko Petkovsek, Herbert S. Wilf, et al

  This book is of interest to mathematicians and computer scientists working in finite mathematics and combinatorics. It presents a breakthrough method for analyzing complex summations.

>