Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A Generalized Information-Theoretic Approach for Bounding the Number of
  Independent Sets in Bipartite Graphs   This paper studies the problem of upper bounding the number of independent
sets in a graph, expressed in terms of its degree distribution. For bipartite
regular graphs, Kahn (2001) established a tight upper bound using an
information-theoretic approach, and he also conjectured an upper bound for
general graphs. His conjectured bound was recently proved by Sah et al. (2019),
using different techniques not involving information theory. The main
contribution of this work is the extension of Kahn's information-theoretic
proof technique to handle irregular bipartite graphs. In particular, when the
bipartite graph is regular on one side, but it may be irregular in the other,
the extended entropy-based proof technique yields the same bound that was
conjectured by Kahn (2001) and proved by Sah et al. (2019).

10
The categories of this paper are: q-bio
9
The categories of this paper are: nlin
22
The categories of this paper are: chao-dyn
8
The categories of this paper are: hep-ex
23
The categories of this paper are: solv-int
35
The categories of this paper are: mtrl-th
5
The categories of this paper are: gr-qc
37
The categories of this paper are: supr-con
27
The categories of this paper are: comp-gas
33
The categories of this paper are: plasm-ph
29
The categories of this paper are: funct-an
3
The categories of this paper are: physics
28
The categories of this paper are: alg-geom
24
The categories of this paper are: dg-ga
30
The categories of this paper are: q-alg
31
The categories of this paper are: ao-sci