Combinatorics and graph theory
This book for undergraduate mathematics students covers the following three central fields: Graph theory, Combinatorics, Infinite combinatorics and graphs. Chapter 1 focuses on the theory of finite graphs: trees, planarity, colouring, matchings, and Ramsey theory. Chapter 2 develops the central techniques of enumerative combinatorics: the principle of inclusion and exclusion, the theory and application of generating functions, the solution of recurrence relations, Pólya's theory of counting arrangements in the presence of symmetry, and important classes of numbers, including the Fibonacci, Catalan, Stirling, Bell, and Euler numbers. Chapter 3 presents infinite pigeonhole principles: König's lemma and Ramsey's theorem. This chapter gives an excellent invitation to combinatorial set theory. The text contains fully worked out examples, exercises at the end of each subchapter, hints and references for further study.
- Additive combinatorics and graph theory
- Mergible states in large NFA
- On elliptic curves \(y^{2} = x^{3}-n^{2}x\) with rank zero
- Representations of the Drazin inverse for a class of block matrices
- Elementary methods of graph Ramsey theory
- On entropy and reversibility of pushdown dynamical systems
- A relationship between bounds on the sum of squares of degrees of a graph
- The construction of association schemes by parameter amendment
- Unrooted non-binary tree-based phylogenetic networks
- scientific article; zbMATH DE number 6515228 (Why is no real title available?)
- scientific article; zbMATH DE number 5294801 (Why is no real title available?)
- Introduction to combinatorics
- The formation of a tree leaf
- scientific article; zbMATH DE number 3957109 (Why is no real title available?)
- Another memorable Mongolian Olympiad problem: a two-colored rectangular lattice
- Bringing calculus into discrete math via the discrete derivative
- scientific article; zbMATH DE number 863511 (Why is no real title available?)
- New MIP model for multiprocessor scheduling problem with communication delays
- Combinatorics, graph theory, algorithms and applications
- Basics of Ramsey Theory
- Finite structures
- A course in combinatorics and graphs
- Distribution of Selmer groups of quadratic twists of a family of elliptic curves
This page was built for publication: Combinatorics and graph theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4950461)
