N. Alon

activity

19982009

most citedDense graphs are antimagic

105 citations · 379 across the 28 of their papers we have counts for

collaborators

Showing 2006Show all

4 papers · 1 filter

math.CO2006

Uniformly cross intersecting families

Noga Alon, Eyal Lubetzky

Let $A$ and $\matchcal{B}$ denote two families of subsets of an $n$ -element set. The pair $(A, B)$ is said to be $ℓ$ -cross-intersecting iff $|A\cap…

math.CO2006

Independent sets in tensor graph powers

Noga Alon, Eyal Lubetzky

The tensor product of two graphs, $G$ and $H$ , has a vertex set $V (G) \times V (H)$ and an edge between $(u, v)$ and $(u^{'}, v^{'})$ iff both $u u^{'} \in E (G)$ and $v v^{'} \in E (H)$ . Let $A (G)$ …

math.CO2006

Privileged users in zero-error transmission over a noisy channel

Noga Alon, Eyal Lubetzky

The $k$ -th power of a graph $G$ is the graph whose vertex set is $V (G)^{k}$ , where two distinct $k$ -tuples are adjacent iff they are equal or adjacent in $G$ in each coordinate. The…

math.CO2006

Graph powers, Delsarte, Hoffman, Ramsey and Shannon

Noga Alon, Eyal Lubetzky

The $k$ -th $p$ -power of a graph $G$ is the graph on the vertex set $V (G)^{k}$ , where two $k$ -tuples are adjacent iff the number of their coordinates which are adjacent in $G$ is not…