Combinatorial Theory

Nachdruck of the 1. Auflage Berlin Heidelberg New York 1979
ISBN: 978-3-540-61787-7
Verlag: Springer Berlin Heidelberg

Buch, Englisch, 483 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 1530 g

Reihe: Classics in Mathematics

This book offers a well-organized, easy-to-follow introduction to combinatorial theory, with examples, notes and exercises. ". a very good introduction to combinatorics. This book can warmly be recommended first of all to students interested in combinatorics." Publicationes Mathematicae Debrecen

Zielgruppe

Research

Autoren/Hrsg.

Aigner, Martin

Fachgebiete

• Mathematik | Informatik Mathematik Operations Research Graphentheorie
• Mathematik | Informatik Mathematik Geometrie Algebraische Geometrie
• Mathematik | Informatik Mathematik Algebra Lineare und multilineare Algebra, Matrizentheorie
• Mathematik | Informatik Mathematik Algebra Elementare Algebra

Inhaltsverzeichnis

Preliminaries.- 1. Sets.- 2. Graphs.- 3. Posets.- 4. Miscellaneous Notation.- I. Mappings.- 1. Classes of Mappings.- 2. Fundamental Orders.- 3. Permutations.- 4. Patterns.- Notes.- II. Lattices.- 1. Distributive Lattices.- 2. Modular and Semimodular Lattices.- 3. Geometric Lattices.- 4. The Fundamental Examples.- Notes.- III. Counting Functions.- 1. The Elementary Counting Coefficients.- 2. Recursion and Inversion.- 3. Binomial Sequences.- 4. Order Functions.- Notes.- IV. Incidence Function.- 1. The Incidence Algebra.- 2. Möbius Inversion.- 3. The Möbius Function.- 4. Valuations.- Notes.- V. Generating Functions.- 1. Ordered Structures.- 2. Unordered Structures.- 3. G-patterns.- 4. G, H-patterns.- Notes.- VI. Matroids: Introduction.- 1. Fundamental Concepts.- 2. Fundamental Examples.- 3. Construction of Matroids.- 4. Duality and Connectivity.- Notes.- VII. Matroids: Further Theory.- 1. Linear Matroids.- 2. Binary Matroids.- 3. Graphic Matroids.- 4. Transversal Matroids.- Notes.- VIII. Combinatorial Order Theory.- 1. Maximum-Minimum Theorems.- 2. Transversal Theorems.- 3. Sperner Theorems.- 4. Ramsey Theorems.- Notes.- List of Symbols.

Über Autor(innen)

Biography of Martin Aigner

Martin Aigner received his Ph.D. in Mathematics in 1965 from the University of Vienna. He then spent five years in the United States, the last two at the University of North Carolina at Chapel Hill where he was introduced to the combinatorial world (which he has never left since) by G. C. Rota and the late R. C. Bose. After extensive travels he returned to Europe and spent three years at the University of Tübingen with a senior fellowship of the German Science Foundation. Since 1974 he has been a Professor of Mathematics at the Free University of Berlin.
Martin Aigner has published in various fields of combinatorics and graph theory and is the author of several monographs on discrete mathematics, graph theory and the theory of search.