The Competitive Programmer Graphs Handbook - Update #2

All the theoretical parts and one out of fourteen practical problems are finished.

Hello there!

The Competitive Programmer Graphs Handbook has been updated since the announcement post. Here’s a comprehensive list of everything that you can read now if you get this early version:

1. Introduction ✔

2. Preliminaries ✔

   1. Basic definitions ✔

   2. The connectivity problem and graph traversals ✔

   3. Connected components ✔

3. Bipartite Graphs:

   1. Basic Definitions ✔

   2. Context ✔

   3. Proposed Problems (1/5)

4. Functional Graphs:

   1. Basic Definitions ✔

   2. Context ✔

   3. Proposed Problems (0/4)

5. Eulerian Paths:

   1. Basic Definitions ✔

   2. Context ✔

   3. Proposed Problems (0/5)

As you can see, chapters 3 to 5 start with all the basic definitions of the specific topic they cover and then explain, based on my experience, the context in which it usually appears in a competitive programming environment. After that, I present carefully selected problems that embody a well-balanced combination of creativity, rigor, and complexity.

If you look carefully, you will notice that all the theoretical parts of the book are finished, and one of the fourteen problems has also been added. I guess this is a perfect time for you to understand the structure of the book and how it will continue to unfold in the future. I am 36 pages in and plan to write around a hundred.

---

Getting early access to the book is a unique opportunity that provides you with a set of exclusive benefits:

• Lifetime access to all the updates.

• Fully functional implementations of all the proposed problems and an online platform where you can try your solutions.

• A private Discord channel available exclusively for early-access purchasers. Here, you can ask questions about the book, get help with your assignments, and share your feedback. It's an excellent opportunity to interact with other readers and the author (me), enhancing your learning experience.

If any of the above sounds good to you, here’s a direct link to the ebook at 50% of the early-access price:

I should say that, with the hopes of making the book more accessible, I have enabled purchasing power parity for my sales, so I can charge customers different amounts depending on the cost of living in their country. Let me know if the price still seems high, and I can make you a special offer.

Feel free to look at the articles related to the book I have published on this blog. They might give you a better idea of what the content of the book is like before buying it:

Mathematical Induction Applied to Graph Theory

Paths, Connectivity, and Trees

The Connectivity Problem

Bipartite Graphs

Thanks to everyone who has bought the book so far. Your support is invaluable and greatly appreciated in completing this project.

---

And that’s it for today! If you are finding this newsletter valuable, consider doing any of these:

1) ✉️ Subscribe to the newsletter — if you aren’t already, consider becoming a free or paid subscriber.

2) 💛 Make a one-off contribution — thanks to all of you who have contributed to support my writing. If you feel like you are not ready for a paid subscription, consider leaving a one-off contribution if you enjoyed this post.

3) 🍻 Read with your friends — this newsletter grows because readers share it. I don’t use social media too much to advertise my writing. I’m counting on you!

Thank you for your support and interest in my work. Your presence means a lot to me.

Have a great day! ☀️

Alberto