42 citations · 175 across the 47 of their papers we have counts for
6 papers · 1 filter
Attempting perfect hypergraphs
Maria Chudnovsky, Gil Kalai
We study several extensions of the notion of perfect graphs to -uniform hypergraphs.
Universal sequences of lines in
Imre Bárány, Gil Kalai, Attila Pór
One of the most important and useful examples in discrete geometry is a finite sequence of points on the moment curve or, more generally, on a {\it st…
Helly-type Problems
Imre Bárány, Gil Kalai
In this paper, we present a variety of problems in the interface between combinatorics and geometry around the theorems of Helly, Radon, Carathéodory, and Tverberg. Through these p…
FKN, first proof, rewritten
Ehud Friedgut, GIl Kalai, Assaf Naor
About twenty years ago we wrote a paper, "Boolean Functions whose Fourier Transform is Concentrated on the First Two Levels", \cite{FKN}. In it we offered several proofs of the sta…
The success probability in Lionel Levine's hat problem is strictly decreasing with the number of players, and this is related to interesting questions regarding Hamming powers of Kneser graphs and independent sets in random subgraphs
Ehud Friedgut, Gil Kalai, Guy Kindler
Lionel Levine's hat challenge has players, each with a (very large, or infinite) stack of hats on their head, each hat independently colored at random black or white. The playe…
Erdős-Szekeres theorem for -flats
Imre Bárány, Gil Kalai, Attila Pór
We extend the famous Erdős-Szekeres theorem to -flats in