國立高雄大學圖資館 |

登入

回首頁

A course in combinatorics and graphs

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	A course in combinatorics and graphsby Simeon Ball, Oriol Serra.
作者:	Ball, Simeon.
其他作者:	Serra, Oriol.
出版者:	Cham :Springer Nature Switzerland :2024.
面頁冊數:	xi, 172 p. :ill. (some col.), digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Combinatorial analysis.
電子資源:	https://doi.org/10.1007/978-3-031-55384-4
ISBN:	9783031553844$q(electronic bk.)

A course in combinatorics and graphs
Ball, Simeon.

A course in combinatorics and graphs[electronic resource] /by Simeon Ball, Oriol Serra. - Cham :Springer Nature Switzerland :2024. - xi, 172 p. :ill. (some col.), digital ;24 cm. - Compact textbooks in mathematics,2296-455X. - Compact textbooks in mathematics..

Preface -- Chapter 1 Symbolic Enumeration -- Chapter 2 Labelled enumeration -- Chapter 3 Enumeration with symmetries -- Chapter 4 Finite Geometries and Latin Squares -- Chapter 5 Matchings -- Chapter 6 Connectivity -- Chapter 7 Planarity -- Chapter 8 Graph Colouring -- Chapter 9 Extremal Graph Theory -- Chapter10 Hints and solutions to selected exercises -- Bibliography.

This compact textbook consists of lecture notes given as a fourth-year undergraduate course of the mathematics degree at the Universitat Politècnica de Catalunya, including topics in enumerative combinatorics, finite geometry, and graph theory. This text covers a single-semester course and is aimed at advanced undergraduates and masters-level students. Each chapter is intended to be covered in 6-8 hours of classes, which includes time to solve the exercises. The text is also ideally suited for independent study. Some hints are given to help solve the exercises and if the exercise has a numerical solution, then this is given. The material covered allows the reader with a rudimentary knowledge of discrete mathematics to acquire an advanced level on all aspects of combinatorics, from enumeration, through finite geometries to graph theory. The intended audience of this book assumes a mathematical background of third-year students in mathematics, allowing for a swifter use of mathematical tools in analysis, algebra, and other topics, as these tools are routinely incorporated in contemporary combinatorics. Some chapters take on more modern approaches such as Chapters 1, 2, and 9. The authors have also taken particular care in looking for clear concise proofs of well-known results matching the mathematical maturity of the intended audience.

ISBN: 9783031553844$q(electronic bk.)

Standard No.: 10.1007/978-3-031-55384-4doiSubjects--Topical Terms:

182280
Combinatorial analysis.

LC Class. No.: QA164

Dewey Class. No.: 511.6

A course in combinatorics and graphs
LDR:02762nmm a22003375a 4500 001 665364
003 DE-He213
005 20240417100334.0
006 m d
007 cr nn 008maaau
008 241219s2024 sz s 0 eng d
020 $a 9783031553844$q(electronic bk.)
020 $a 9783031553837$q(paper)
024 7 $a 10.1007/978-3-031-55384-4 $2 doi
035 $a 978-3-031-55384-4
040 $a GP $c GP
041 0 $a eng
050 4 $a QA164
072 7 $a PBD $2 bicssc
072 7 $a MAT008000 $2 bisacsh
072 7 $a PBD $2 thema
082 0 4 $a 511.6 $2 23
090 $a QA164 $b .B187 2024
100 1 $a Ball, Simeon. $3 869327
245 1 2 $a A course in combinatorics and graphs $h [electronic resource] / $c by Simeon Ball, Oriol Serra.
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Birkhäuser, $c 2024.
300 $a xi, 172 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Compact textbooks in mathematics, $x 2296-455X
505 0 $a Preface -- Chapter 1 Symbolic Enumeration -- Chapter 2 Labelled enumeration -- Chapter 3 Enumeration with symmetries -- Chapter 4 Finite Geometries and Latin Squares -- Chapter 5 Matchings -- Chapter 6 Connectivity -- Chapter 7 Planarity -- Chapter 8 Graph Colouring -- Chapter 9 Extremal Graph Theory -- Chapter10 Hints and solutions to selected exercises -- Bibliography.
520 $a This compact textbook consists of lecture notes given as a fourth-year undergraduate course of the mathematics degree at the Universitat Politècnica de Catalunya, including topics in enumerative combinatorics, finite geometry, and graph theory. This text covers a single-semester course and is aimed at advanced undergraduates and masters-level students. Each chapter is intended to be covered in 6-8 hours of classes, which includes time to solve the exercises. The text is also ideally suited for independent study. Some hints are given to help solve the exercises and if the exercise has a numerical solution, then this is given. The material covered allows the reader with a rudimentary knowledge of discrete mathematics to acquire an advanced level on all aspects of combinatorics, from enumeration, through finite geometries to graph theory. The intended audience of this book assumes a mathematical background of third-year students in mathematics, allowing for a swifter use of mathematical tools in analysis, algebra, and other topics, as these tools are routinely incorporated in contemporary combinatorics. Some chapters take on more modern approaches such as Chapters 1, 2, and 9. The authors have also taken particular care in looking for clear concise proofs of well-known results matching the mathematical maturity of the intended audience.
650 0 $a Combinatorial analysis. $3 182280
650 0 $a Graph theory. $3 181880
650 1 4 $a Discrete Mathematics. $3 524738
650 2 4 $a Geometry. $3 183883
700 1 $a Serra, Oriol. $3 978177
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Compact textbooks in mathematics. $3 700241
856 4 0 $u https://doi.org/10.1007/978-3-031-55384-4
950 $a Mathematics and Statistics (SpringerNature-11649)