Manchester Building (Hall 2), Hebrew University Jerusalem
Abstract: A spanning tree of a graph G is a subgraph with the same vertex set which is a tree. In 1981, McKay proved an asymptotic result regarding the number of spanning trees in random k-regular graphs. In this talk we will discuss an analogous result for certain random simplicial complexes (All terms will be explained in the talk).
.
The talk is based on a joint work with Lior Tenenbaum.
Manchester Building (Hall 2), Hebrew University Jerusalem
I will discuss some recent advances in combinatorics, among them the disproof of Hedetniemi conjecture by Shitov, the proof of the sensitivity conjecture by Huang, the progress on the Erdos-Rado sunflower conjecture by Alweiss, Lovett, Wu, and Zhang, and the progress on the expectation threshold conjecture by Frankston, Kahn, Narayanan, and Park.
