April 11, 2018
The vertex set of the Kneser graph $K(n,k)$ is $V = \binom{[n]}{k}$ and two vertices are adjacent if the corresponding sets are disjoint. For any graph $F$, the largest size of a vertex set $U \subseteq V$ such that $K(n,k)[U]$ is $F$-free, was recently determined by Alishahi and Taherkhani, whenever $n$ is large enough compared to $k$ and $F$. In this paper, we determine the second largest size of a vertex set $W \subseteq V$ such that $K(n,k)[W]$ is $F$-free, in the case wh...
June 23, 2014
Denote by $\mathcal{H}_k (n,p)$ the random $k$-graph in which each $k$-subset of $\{1... n\}$ is present with probability $p$, independent of other choices. More or less answering a question of Balogh, Bohman and Mubayi, we show: there is a fixed $\varepsilon >0$ such that if $n=2k+1$ and $p> 1-\varepsilon$, then w.h.p. (that is, with probability tending to 1 as $k\rightarrow \infty$), $\mathcal{H}_k (n,p)$ has the "Erd\H{o}s-Ko-Rado property." We also mention a similar rando...
June 24, 2023
In this expository article, we give a gentle introduction to the Erd\H{o}s-R\'enyi random graphs and threshold phenomena that they exhibit. We also mildly introduce the Kahn-Kalai Conjecture with several intuitive examples, mainly targeting the general audience.
February 14, 2017
We prove that for a large family of product graphs, and for Kneser graphs $K(n,\alpha n)$ with fixed $\alpha <1/2$, the following holds. Any set of vertices that spans a small proportion of the edges in the graph can be made independent by removing a small proportion of the vertices of the graph. This allows us to strengthen the results of [DinurFR06] and [DinurF09], and show that any independent set in these graphs is almost contained in an independent set which depends on f...
June 11, 2020
We study the weak $K_s$-saturation number of the Erd\H{o}s--R\'{e}nyi random graph $\mathbbmsl{G}(n, p)$, denoted by $\mathrm{wsat}(\mathbbmsl{G}(n, p), K_s)$, where $K_s$ is the complete graph on $s$ vertices. Kor\'{a}ndi and Sudakov in 2017 proved that the weak $K_s$-saturation number of $K_n$ is stable, in the sense that it remains the same after removing edges with constant probability. In this paper, we prove that there exists a threshold for this stability property and ...
October 2, 2018
Given positive integers $n\ge 2k$, the {\it Kneser graph} $KG_{n,k}$ is a graph whose vertex set is the collection of all $k$-element subsets of the set $\{1,\ldots, n\}$, with edges connecting pairs of disjoint sets. One of the classical results in combinatorics, conjectured by Kneser and proved by Lov\'asz, states that the chromatic number of $KG_{n,k}$ is equal to $n-2k+2$. In this paper, we study the chromatic number of the {\it random Kneser graph} $KG_{n,k}(p)$, that is...
September 17, 2020
The determining number of a graph $G = (V,E)$ is the minimum cardinality of a set $S\subseteq V$ such that pointwise stabilizer of $S$ under the action of $Aut(G)$ is trivial. In this paper, we provide some improved upper and lower bounds on the determining number of Kneser graphs. Moreover, we provide the exact value of the determining number for some subfamilies of Kneser graphs.
June 22, 2024
The Erd\H{o}s--Ko--Rado (EKR) theorem and its generalizations can be viewed as classifications of maximum independent sets in appropriately defined families of graphs, such as the Kneser graph $K(n,k)$. In this paper, we investigate the independence number of random spanning subraphs of two other families of graphs whose maximum independent sets satisfy an EKR-type characterization: the derangement graph on the set of permutations in $\mathrm{Sym}(n)$ and the derangement grap...
December 16, 2014
A family of sets is intersecting if no two of its members are disjoint, and has the Erd\H{o}s-Ko-Rado property (or is EKR) if each of its largest intersecting subfamilies has nonempty intersection. Denote by $\mathcal{H}_k(n,p)$ the random family in which each $k$-subset of $\{1\dots n\}$ is present with probability $p$, independent of other choices. A question first studied by Balogh, Bohman and Mubayi asks: \[ \mbox{for what $p=p(n,k)$ is $\mathcal{H}_k(n,p)$ likely to be...
October 16, 2015
For an $r$-uniform hypergraph $H$, let $f(H)$ be the minimum number of complete $r$-partite $r$-uniform subhypergraphs of $H$ whose edge sets partition the edge set of $H$. For a graph $G$, $f(G)$ is the bipartition number of $G$ which was introduced by Graham and Pollak in 1971. In 1988, Erd\H{o}s conjectured that if $G \in G(n,1/2)$, then with high probability $f(G)=n-\alpha(G)$, where $\alpha(G)$ is the independence number of $G$. This conjecture and related problems have ...