-
Recent Posts
Archives
- 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 (1)
- Combinatorics (26)
- Conferences (1)
- Finite Geometry (20)
- Incidence Geometry (8)
- Number Theory (1)
- Polynomial Method (13)
- Real Analysis (1)
- References (1)
- Research Diary (1)
Blogs I Follow
- 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
- Points And Lines
- Some Plane Truths
- Gentzen translated
- E. Kowalski's blog
- Quomodocumque
- Short, Fat Matrices
- Combinatorics and more
- Yufei Zhao
- Abhishek Khetan
- urduwallahs
- Gaurish4Math
- Jerusalem Combinatorics Seminar
- Personal Blog
- The value of the variable
- Uniformly at Random
- The Same Name for Different Things
- Theoretical Physics and Related Math
- in theory
- mathbabe
Author Archives: Anurag Bishnoi
Ramsey numbers from pseudorandom graphs
One of the foundational results in modern combinatorics is Ramsey’s theorem which states that for every positive integers there exists a constant such that for all , every -coloring of edges of the complete graph has a monochromatic copy of … Continue reading
Spectral proofs of theorems on the boolean hypercube
In a recent breakthrough Hao Huang proved the sensitivity conjecture, that had remained open for past 30 years despite some serious effort from various computer scientists and mathematicians. The proof can be described in a single tweet (if you have … Continue reading
Pseudorandom clique-free graphs
Pseudorandom graphs are graphs that in some way behaves like a random graph with the same edge density. One way in which this happens is as follows. In the random graph , with , a direct application of Chernoff bound … Continue reading
Posted in Combinatorics, Extremal Combinatorics, Spectral Graph Theory
Tagged alon, pseudorandom, pseudorandom graphs
2 Comments
Ryser’s conjecture
I am on a research visit in Rome, working with Valentina Pepe, and our joint paper on Ryser’s conjecture is on arXiv now. So this seems like the right time to talk about the conjecture and the problems related to … Continue reading
Wenger graphs
A central (and foundational) question in extremal graph theory is the forbidden subgraph problem of Turán, which asks for the largest number of edges in an -vertex graph that does not contain any copy of a given graph as its … Continue reading
The footprint bound
Studying the set of common zeros of systems of polynomial equations is a fundamental problem in algebra and geometry. In this post we will look at estimating the cardinality of the set of common zeros, when we already know that … Continue reading
Introduction to polynomial method
(The following is a blog-friendly version of Chapter 7 of my PhD thesis, which is an introduction to the so-called polynomial method.) The polynomial method is an umbrella term for different techniques involving polynomials which have been used to solve … Continue reading