Back to the main page on my research interests

 Extremal and probabilistic combinatorics, spectral graph theory, and connections to information theory
 


Journal Papers
  1. N. Krupnik, I. Sason, and A. Berman, "On the transitivity of generalized-Hamming graphs and their complements," submitted, April 2026.

  2. I. Sason, "Counting graph homomorphisms in bipartite settings," submitted, September 2025; revised, July 2026.

  3. I. Sason, "The Lovasz local lemma: foundations and applications," AIMS Mathematics, topical section: Combinatorics and Graph Theory, vol. 11, no. 7, pp. 19659-19715, paper 798, July 2026.

  4. I. Sason, "Mathematical foundations of information theory (editorial paper)," AIMS Mathematics, special issue: Mathematical Foundations of Information Theory, vol. 11, no. 2, paper 132, pp. 3269-3274, February 2026.

  5. N. Lavi and I. Sason, "Advances in the Shannon capacity of graphs," AIMS Mathematics, special issue: Mathematical Foundations of Information Theory, vol. 11, no. 1, paper 111, pp. 2747-2796, January 2026.

  6. I. Sason, "An example showing that Schrijver's theta-function need not upper bound the Shannon capacity of a graph,'' AIMS Mathematics, special issue: Mathematical Foundations of Information Theory, vol. 10, no. 7, paper 695, pp. 15294-15301, July 2025.

  7. I. Sason, "On H-intersecting graph families and counting of homomorphisms,'' AIMS Mathematics, special issue: Mathematical Foundations of Information Theory, vol. 10, no. 3, paper 290, pp. 6355-6378, March 2025.

  8. I. Sason, "On strongly regular graphs and the friendship theorem," Mathematics, vol. 13, no. 6, paper 970, pp. 1-21, March 2025.

  9. I. Sason, N. Krupnik, S. Hamud, and A. Berman, "On spectral graph determination,'' Mathematics, vol. 13, no. 4, paper 549, pp. 1-44, February 2025.

  10. I. Sason, "Observations on graph invariants with the Lovasz theta-function,'' AIMS Mathematics, special issue: Mathematical Foundations of Information Theory, vol. 9, no. 6, paper 747, pp. 15385-15468, April 2024.

  11. I. Sason, "Observations on the Lovasz theta-function, graph capacity, eigenvalues, and strong products,'' Entropy, vol. 25, no. 1, paper 104, pages 1-40, January 2023.

  12. I. Sason, "Information inequalities via submodularity, and a problem in extremal graph theory,'' Entropy, vol. 24, no. 5, paper 597, pages 1-31, April 2022.

  13. I. Sason, "A generalized information-theoretic approach for bounding the number of independent sets in bipartite graphs,'' Entropy, vol. 23, no. 3, paper 270, pages 1-14, March 2021.

Some Talks on this Research Work
  1. I. Sason, ``On counting graph homomorphisms by entropy arguments,'' Proceedings of the 13th European Conference on Combinatorics, Graph Theory and Applications, pp. 1003-1011 (extended abstract), Budapest, Hungary, August 25-29, 2025. See the slides, extended abstract, and full paper version on arXiv.

  2. I. Sason, ``On H-intersecting graph families,'' Proceedings of the 13th European Conference on Combinatorics, Graph Theory and Applications, pp. 1012-1018 (extended abstract), Budapest, Hungary, August 25-29, 2025. See the poster and extended abstract.

  3. I. Sason, ``Schrijver's theta-function need not upper bound the Shannon capacity of a graph,'' 2025 International Conference on Enumerative Combinatorics and Applications, virtual, August 25-27, 2025. See the abstract, slides, full paper version, and the recorded talk.

  4. I. Sason, ``On strongly regular graphs, the friendship theorem, and the Shannon capacity of graphs,'' Algorithmic Graph Theory Seminar Series, April 28, 2025. See the slides and video recording.

  5. I. Sason, ``On strongly regular graphs, the friendship theorem, Lovasz theta-function, and Shannon capacity of graphs,'' School of Mathematical Sciences, Tel-Aviv University, Israel, March 23, 2025. See the abstract and slides.

  6. I. Sason, ``On strongly regular graphs, friendship, and the Shannon capacity,'' 2025 Information Theory and Applications Workshop, San-Diego, California, USA, February 9-14, 2025. See the slides.

  7. I. Sason, "Entropy, counting, and Shearer's inequalities," the Einstein Institute of Mathematics, Hebrew University of Jerusalem, Israel, December 16, 2024. See the abstract and slides.

  8. I. Sason, "Combinatorial applications of the Shearer and Han inequalities in graph theory and Boolean functions,'' Workshop on Information Theory, Boolean Functions, and Lattice Problems, Hausdorff Research Institute for Mathematics (HIM), Bonn, Germany, November 18-22, 2024. See the slides and recorded talk.

  9. I. Sason, "Combinatorial applications of the Shearer's lemma and generalizations," seminar talk at ETH - Swiss Federal Institute of Technology, Zurich, Switzerland, November 1, 2024. See the slides.

  10. I. Sason, ``Observations on the Lovasz theta-function, Shannon capacity of graphs, eigenvalues, and strong products,'' Proceedings of the 10th Slovenian Conference on Graph Theory (SiCGT23), Kranjska Gora, Slovenia, June 18-24, 2023. See the slides.

  11. I. Sason, "Shannon entropy and bipartite graphs,'' Mini-Workshop on New Mathematical Techniques in Information Theory, the Mathematical Research Institute of Oberwolfach (MFO), Germany, March 13-19, 2022. See the slides and the recorded talk.

  12. I. Sason, ``Entropy-based proofs of combinatorial results on bipartite graphs," Proceedings of the 2021 IEEE International Symposium on Information Theory, pp. 3225-3230, July 12-20, 2021 (an online virtual conference). See the paper, slides, recorded short and full presentations.