126 citations · 834 across the 125 of their papers we have counts for
100 papers · 1 filter
The power of many colours
Noga Alon, Matija Bucić, Micha Christoph +1
A classical problem, due to Gerencsér and Gyárfás from 1967, asks how large a monochromatic connected component can we guarantee in any -edge colouring of ? We consider how…
On bipartite coverings of graphs and multigraphs
Noga Alon
A bipartite covering of a (multi)graph is a collection of bipartite graphs, so that each edge of belongs to at least one of them. The capacity of the covering is the sum of…
Strong blocking sets and minimal codes from expander graphs
Noga Alon, Anurag Bishnoi, Shagnik Das +1
A strong blocking set in a finite projective space is a set of points that intersects each hyperplane in a spanning set. We provide a new graph theoretic construction of such sets:…
The limit points of the top and bottom eigenvalues of regular graphs
Noga Alon, Fan Wei
We prove that for each the set of all limit points of the second largest eigenvalue of growing sequences of -regular graphs is . A similar argument s…
Graph-codes
Noga Alon
The symmetric difference of two graphs on the same set of vertices is the graph on whose set of edges are all edges that belong to exactly…
Invertibility of digraphs and tournaments
Noga Alon, Emil Powierski, Michael Savery +2
For an oriented graph and a set , the inversion of in is the digraph obtained by reversing the orientations of the edges of with both endpoints in…