research
∙
08/31/2023
Erdős–Ko–Rado type results for partitions via spread approximations
In this paper, we address several Erdős–Ko–Rado type questions for famil...
share
research
∙
06/03/2022
Erdős Matching Conjecture for almost perfect matchings
In 1965 Erdős asked, what is the largest size of a family of k-elements ...
research
∙
08/01/2021
On the maximum number of distinct intersections in an intersecting family
For n > 2k ≥ 4 we consider intersecting families ℱ consisting of k-subse...
research
∙
06/09/2021
Uniform intersecting families with large covering number
A family ℱ has covering number τ if the size of the smallest set interse...
research
∙
04/18/2020
Maximal degrees in subgraphs of Kneser graphs
In this paper, we study the maximum degree in non-empty induced subgraph...
research
∙
05/20/2019
Sharp results concerning disjoint cross-intersecting families
For an $n$-element set $X$ let $\binom{X}{k}$ be the collection of all i...
research
∙
01/12/2019
Simple juntas for shifted families
We say that a family F of k-element sets is a j-junta if there is a set...
research
∙
12/12/2018
The Crossing Tverberg Theorem
Tverberg's theorem is one of the cornerstones of discrete geometry. It s...
research
∙
10/02/2018
Sharp bounds for the chromatic number of random Kneser graphs
Given positive integers n> 2k, a Kneser graph KG_n,k is a graph whose ve...
research
∙
10/01/2018
Degree versions of theorems on intersecting families via stability
The matching number of a family of subsets of an n-element set is the ma...
research
∙
09/08/2017
