Discrete mathematics and its applications· 2013· Book chapter
Extremal Graph Theory
- 1,695citations
- 2013year
Short summary
This volume offers a concise yet comprehensive treatment of extremal graph theory, featuring complete proofs for nearly all results and numerous exercises.
AI-generated from the title and abstract; the full text is not read.
Key points
- Presents a comprehensive treatment of extremal graph theory.
- Includes complete proofs for almost all results.
- Features numerous exercises of varying difficulty.
- Demonstrates applications in economics, computer science, and optimization.
AI-generated from the title and abstract; the full text is not read.
Abstract
The ever-expanding field of extremal graph theory encompasses a diverse array of problem-solving methods, including applications to economics, computer science, and optimization theory. This volume, based on a series of lectures delivered to graduate students at the University of Cambridge, presents a concise yet comprehensive treatment of extremal graph theory.Unlike most graph theory treatises, this text features complete proofs for almost all of its results. Further insights into theory are provided by the numerous exercises of varying degrees of difficulty that accompany each chapter. A
The authors' abstract, as published at the source. Discrete mathematics and its applications, 2013 · DOI ↗
Continue with a free account
Ask the paper: 3 free questions a day about this paper; save it, get its citation, new summaries every day for your field. Takeaways are Premium.
Continue free on the webSign in with Google or Apple; no card needed. You come back to this paper.
On your phone:
Field: Discrete Mathematics and Combinatorics
Discrete Mathematics and CombinatoricsMathematics