299 citations · 892 across the 53 of their papers we have counts for
5 papers · 1 filter
Advances in the Shannon Capacity of Graphs
Nitay Lavi, Igal Sason
We derive exact values and new bounds for the Shannon capacity of two families of graphs: the -Kneser graphs and the tadpole graphs. We also construct a countably infinite famil…
Counting Graph Homomorphisms in Bipartite Settings
Igal Sason
This paper studies the problem of counting homomorphisms from a bipartite source graph to a bipartite target graph. An exact formula is first derived for the number of homomorphism…
An example showing that Schrijver's -function need not upper bound the Shannon capacity of a graph
Igal Sason
This letter addresses an open question concerning a variant of the Lovász function, which was introduced by Schrijver and independently by McEliece et al. (1978). The q…
On Strongly Regular Graphs and the Friendship Theorem
Igal Sason
This paper presents an alternative proof of the celebrated friendship theorem, originally established by Erdős, Rényi, and Sós (1966). The proof relies on a closed-form expression…
On H-Intersecting Graph Families and Counting of Homomorphisms
Igal Sason
This work derives an upper bound on the maximum cardinality of a family of graphs on a fixed number of vertices, in which the intersection of every two graphs in that family contai…