30 citations · 56 across the 10 of their papers we have counts for
6 papers · 1 filter
On the First Eigenvalue of Bipartite Graphs
Amitava Bhattacharya, Shmuel Friedland, Uri N. Peled
In this paper we study the maximum value of the largest eigenvalue for simple bipartite graphs, where the number of edges is given and the number of vertices on each side of the bi…
An upper bound for the number of perfect matchings in graphs
Shmuel Friedland
We give an upper bound on the number of perfect matchings in an undirected simple graph with an even number of vertices, in terms of the degrees of all the vertices in . Thi…
The maximum number of perfect matchings in graphs with a given degree sequence
Noga Alon, Shmuel Friedland
We show that the number of perfect matching in a simple graph with an even number of vertices and degree sequence is at most $\prod_{i=1}^n (d_i !)^{\frac{1…
On the Number of Matchings in Regular Graphs
S. Friedland, E. Krop, K. Markström
For the set of graphs with a given degree sequence, consisting of any number of and , and its subset of bipartite graphs, we characterize the optimal graphs who maximize…
The Polytope of Dual Degree Partitions
Amitava Bhattacharya, Shmuel Friedland, Uri N. Peled
We determine the extreme points and facets of the convex hull of all dual degree partitions of simple graphs on vertices.
Theory of Computation of Multidimensional Entropy with an Application to the Monomer-Dimer Problem
Shmuel Friedland, Uri N. Peled
We outline the most recent theory for the computation of the exponential growth rate of the number of configurations on a multi-dimensional grid. As an application we compute the m…