Theoretical Statistics and Mathematics Unit, ISI Delhi

February 12, 2020 (Wednesday) ,
3:30 PM at Webinar

Speaker:
Kaushik Majumder,
IIT Goa

Title:
Some recent results on uniform intersecting hypergraph?

Abstract of Talk

A pair $(V,\mathbb{E})$ is said to be \emph{finite uniform intersecting hypergraph}, where $V$ is a non-empty finite set, $\mathbb{E}\subset\binom{V}{k}$ for some integer $k\geq2$ and for each $B$
and $B'\in\mathbb{E}$, $B\cap B'\neq\emptyset$. Here for each integer $k\geq2$, the set of all subsets of $V$, with size $k$ is denoted as $\binom{V}{k}$. An example of such hypergraph is if we take $V=[2k-1]$ and $\mathbb{E}=\binom{[2k-1]}{k}$, where $[2k-1]=\{1,2,\ldots,2k-1\}$. In this
talk, we show some recent results and discuss some open questions on the maximal uniform intersecting hypergraph.