-
Recent Posts
Archives
- 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 (1)
- Combinatorics (29)
- Extremal Combinatorics (10)
- Ramsey Theory (1)
- Spectral Graph Theory (6)
- Conferences (1)
- Finite Geometry (21)
- Incidence Geometry (9)
- 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
Extending Ryser’s conjecture
In an earlier post, I talked about Ryser’s conjecture on -partite -uniform hypergraphs, that has stayed open for all despite a considerable effort by several mathematicians over a period of 50 years. A bit more effort has been spent on … Continue reading
Posted in Combinatorics, Extremal Combinatorics
Tagged hypergraphs, Patrick Morris, postdoc, research, Ryser, Shagnik Das, Tibor Szabo, vertex cover
Leave a comment
Bound on Ramsey numbers from finite geometry
In an earlier post I talked about the work of Mubayi and Verstraete on determining the off-diagonal Ramsey numbers via certain optimal pseudorandom graphs, which are not yet known to exist except for the case of triangles. Beyond this conditional … Continue reading
Kopparty’s graph
Alon’s construction of optimal pseudorandom graphs from 1994 is useful for obtaining several interesting combinatorial results in various areas of mathematics, some of which are highlighted in this survey of Noga from last year (also see my previous post). In … Continue reading
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
3 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
