Fetching the paper…
Reading the bibliography…
We explain the notion of the {\em entropy} of a discrete random variable, and derive some of its basic properties.
C. Shannon, A Mathematical Theory of Communication, Bell System Technical Journal
1948
Earlier work this paper cites.
L. Loomis and H. Whitney, An inequality related to the isoperimetric inequality, Bull. Amer. Math. Soc
1949
Earlier work this paper cites.
H. Shapiro, Problem E 1399, The American Mathematical Monthly
1960
Earlier work this paper cites.
P. Erdős and A. Rényi, On two problems of information theory, Publ. Hung. Acad. Sci
1963
Earlier work this paper cites.
B. Lindström, On a combinatorial problem in number theory, Can. Math. Bull
1965
Earlier work this paper cites.
D. Cantor and W. Mills, Determination of a subset from certain combinatorial properties, Can. J. Math
1966
Earlier work this paper cites.
L. Moser, The second moment method in combinatorial analysis, in “Combinatorial Structures and Their Applications”, 283–384, Gordon and Breach, New York, 1970
1970
Earlier work this paper cites.
J. Rowlinson and B. Widom, New Model for the Study of Liquid-Vapor Phase Transitions, J. Chem. Phys
1970
Earlier work this paper cites.
M. Tribus and E. McIrvine, Energy and Information, Scientific American
1971
Earlier work this paper cites.
L. Brégman, Some properties of nonnegative matrices and their permanents, Soviet Math. Dokl
1973
Earlier work this paper cites.
N. Pippinger, An information-theoretic method in combinatorial theory, Journal of Combinatorial Theory, Series A
1977
Earlier work this paper cites.
T. Han, Nonnegaitive entropy measures for multivariate symmetric correlations, Inform. Contr
1978
Earlier work this paper cites.
A. Schrijver, A short proof of Minc’s conjecture, J. Combin. Theory Ser. A
1978
Earlier work this paper cites.
L. Valiant, The Complexity of Computing the Permanent, Theoretical Computer Science
1979
Earlier work this paper cites.
Alon, N, On the number of subgraphs of prescribed type of graphs with a given number of edges, Israel Journal of Mathematics
1981
Earlier work this paper cites.
H. Wilf, Backtrack: An O ( 1 ) O(1) expected time algorithm for the graph coloring problem, Information Processing Letters
1984
Earlier work this paper cites.
E. Bender and H. Wilf, A theoretical analysis of backtracking in the graph coloring problem, Journal of Algorithms
1985
Earlier work this paper cites.
F. Chung, P. Frankl, R. Graham and J. Shearer, Some intersection theorems for ordered sets and graphs, J. Combin. Theory Ser. A
1986
Earlier work this paper cites.
N. Linial, Legal coloring of graphs, Combinatorica
1986
Earlier work this paper cites.
N. Alon, Independent sets in regular graphs and sum-free subsets of finite groups, Israel J. Math
1991
Cited alongside, same era.
J. Radhakrishnan, An entropy proof of Brégman’s theorem, J. Combin. Theory, Ser. A
1997
Cited alongside, same era.
E. Friedgut and J. Kahn, On the number of copies of one hypergraph in another, Israel Journal of Mathematics
1998
Cited alongside, same era.
J. Kahn and A. Lawrenz, Generalized Rank Functions and an Entropy Argument, Journal of Combinatorial Theory, Series A
1999
Cited alongside, same era.
N. Alon and J. Spencer, The Probabilistic Method
2000
Cited alongside, same era.
J. Kahn, An Entropy Approach to the Hard-Core Model on Bipartite Graphs, Combin. Probab. Comput
2001
D. Galvin, An upper bound for the number of independent sets in regular graphs, Discrete Math
2009
Later among the works it cites.
S. Ross, A first course in probability
2009
Later among the works it cites.
P.-S. Loh, O. Pikhurko and B. Sudakov, Maximizing the Number of q q -Colorings, Proc. London Math. Soc
2010
Later among the works it cites.
M. Madiman and P. Tetali, Information Inequalities for Joint Distributions, with Interpretations and Applications, IEEE Trans. on Information Theory
2010
Later among the works it cites.
Y. Zhao, The Number of Independent Sets in a Regular Graph, Combin. Probab. Comput
2010
Later among the works it cites.
J. Cutler and A. Radcliffe, An entropy proof of the Kahn-Lovász theorem, Electronic Journal of Combinatorics
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
J. Kahn, Range of cube-indexed random walk, Israel J. Math
2001
Cited alongside, same era.
J. Kahn, Entropy, independent sets and antichains: A new approach to Dedekinds problem, Proc. AMS
2001
Cited alongside, same era.
J. Radhakrishnan, Entropy and counting, in Computational mathematics, modelling and algorithms (J. C. Misra, editor), Narosa, 2003, 146–168
2003
Cited alongside, same era.
E. Friedgut, Hypergraphs, Entropy and Inequalities, The American Mathematical Monthly
2004
Cited alongside, same era.
D. Galvin and P. Tetali, On weighted graph homomorphisms, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 63
2004
Cited alongside, same era.
E. Friedgut and J. Kahn, On the Number of Hamiltonian Cycles in a Tournament, Combinatorics Probability and Computing
2005
Cited alongside, same era.
2011
Later among the works it cites.
S. Kopparty and B. Rossman, The homomorphism domination exponent, European Journal of Combinatorics
2011
Later among the works it cites.
Y. Zhao, The bipartite swapping trick on graph homomorphisms, SIAM J. Discrete Math
2011
Later among the works it cites.
P. Balister and B. Bollobás, Projections, entropy and sumsets, Combinatorica
2012
Later among the works it cites.
J. Cutler, Coloring graphs with graphs: a survey, Graph Theory Notes N.Y
2012
Later among the works it cites.
D. Ellis, Y. Filmus and E. Friedgut, Triangle intersecting families of graphs, Journal of the European Math. Soc
2012
Later among the works it cites.
J. Engbers and D. Galvin, H H -coloring tori, J. Combin. Theory Ser. B
2012
Later among the works it cites.
J. Engbers and D. Galvin, H H -colouring bipartite graphs (with J. Engbers), J. Combin. Theory Ser. B
2012
Later among the works it cites.
M. Madiman, A. Marcus and P. Tetali, Entropy and Set Cardinality Inequalities for Partition-determined Functions and Application to Sumsets, Random Structures & Algorithms
2012
Later among the works it cites.
D. Galvin, Maximizing H-colorings of regular graphs, Journal of Graph Theory
2013
Later among the works it cites.
L. Ilinca and J. Kahn, Asymptotics of the upper matching conjecture, J. Combin. Theory Ser. A
2013
Later among the works it cites.
L. Ilinca and J. Kahn, Counting Maximal Antichains and Independent Sets, Order
2013
Later among the works it cites.
N. Pippenger, Entropy and enumeration of Boolean functions, IEEE Trans. Info. Th
2096
Closest in time.