1 citations · 1 across the 3 of their papers we have counts for
5 papers · 1 filter
Non-trivially intersecting multi-part families
Matthew Kwan, Benny Sudakov, Pedro Vieira
We say a family of sets is intersecting if any two of its sets intersect, and we say it is trivially intersecting if there is an element which appears in every set of the family. I…
Two remarks on even and oddtown problems
Benny Sudakov, Pedro Vieira
A family of subsets of an -element set is called an eventown (resp. oddtown) if all its sets have even (resp. odd) size and all pairwise intersections have even siz…
Finding paths in sparse random graphs requires many queries
Asaf Ferber, Michael Krivelevich, Benny Sudakov +1
We discuss a new algorithmic type of problem in random graphs studying the minimum number of queries one has to ask about adjacency between pairs of vertices of a random graph $G\s…
Finding Hamilton cycles in random graphs with few queries
Asaf Ferber, Michael Krivelevich, Benny Sudakov +1
We introduce a new setting of algorithmic problems in random graphs, studying the minimum number of queries one needs to ask about the adjacency between pairs of vertices of ${\mat…
Almost-Fisher families
Shagnik Das, Benny Sudakov, Pedro Vieira
A classic theorem in combinatorial design theory is Fisher's inequality, which states that a family of subsets of with all pairwise intersections of size can…