-
Recent Posts
Archives
- February 2024 (1)
- June 2023 (1)
- May 2023 (1)
- March 2023 (3)
- January 2023 (2)
- March 2022 (1)
- August 2021 (1)
- March 2021 (2)
- November 2020 (1)
- October 2020 (1)
- September 2020 (3)
- August 2020 (2)
- January 2020 (2)
- December 2019 (1)
- September 2019 (1)
- July 2019 (1)
- May 2019 (1)
- September 2018 (1)
- April 2018 (1)
- March 2018 (1)
- November 2017 (2)
- August 2017 (2)
- July 2017 (1)
- April 2017 (2)
- September 2016 (1)
- July 2016 (1)
- May 2016 (2)
- December 2015 (1)
- October 2015 (1)
- August 2015 (2)
- June 2015 (1)
- May 2015 (1)
- April 2015 (1)
- March 2015 (4)
- January 2015 (1)
- September 2014 (3)
- August 2014 (1)
- July 2012 (3)
Categories
- Coding Theory (8)
- Combinatorics (45)
- Extremal Combinatorics (23)
- Ramsey Theory (8)
- Spectral Graph Theory (7)
- Conferences (1)
- Finite Geometry (33)
- Incidence Geometry (14)
- Job openings (1)
- Mentorship (1)
- Number Theory (1)
- Polynomial Method (15)
- Real Analysis (1)
- References (1)
- Research Diary (1)
- Uncategorized (3)
Blogs I Follow
- Historically Speaking
- sudipta1411
- For a cup of coffee more
- Eda Kaja
- I Can't Believe It's Not Random!
- Random Permutations
- What's new
- Manu S Pillai
- cgroenland.wordpress.com/
- Radimentary
- Cosmin Pohoata
- Sleepless in Seattle
- Bloag
- Jagriti is professoring
- Math3ma
- Aparajita's blog
- The Intrepid Mathematician
- Ratio Bound – A Combinatorics Blog
- all the women
- ellipticnews
- Becoming My Better Self
- Some Plane Truths
- Gentzen translated
- E. Kowalski's blog
- Quomodocumque
- Short, Fat Matrices
- Combinatorics and more
- Yufei Zhao
- Abhishek Khetan
- urduwallahs
Monthly Archives: August 2014
Strongly regular graphs
A graph is called regular if its every vertex has the same number of neighbours. For example, this is a regular graph where each vertex has exactly three neighbours: It is the well known Petersen graph which is so important and popular in graph … Continue reading
Anurag's Math Blog 