3 citations · 3 across the 3 of their papers we have counts for
4 papers
Aggregating maximal cliques in real-world graphs
Noga Alon, Sabyasachi Basu, Shweta Jain +3
Maximal clique enumeration is a fundamental graph mining task, but its utility is often limited by computational intractability and highly redundant output. To address these challe…
Random Cayley graphs and random sumsets
Noga Alon, Huy Tuan Pham
We prove that any finite abelian group contains a collection of not too many subsets with a special structure, so that for every subset of with a small doubling, there…
The Helly number of Hamming balls and related problems
Noga Alon, Zhihan Jin, Benny Sudakov
We prove the following variant of Helly's classical theorem for Hamming balls with a bounded radius. For and any (finite or infinite) set , if in a family of Hamming balls…
Increasing the chromatic number of a random graph
N. Alon, B. Sudakov
What is the minimum number of edges that have to be added to the random graph in order to increase its chromatic number by one percent ? One possibility is t…