A partially ordered set of functionals corresponding to graphs

DOI10.1016/0012-365X(94)90388-3zbMath0805.05007MaRDI QIDQ1332414

Alexander Sidorenko

Publication date: 26 January 1995

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

functional; poset; homomorphisms; graphs; symmetric functions; trees; partial order; measure space

Mathematics Subject Classification ID

05C05: Trees

05A99: Enumerative combinatorics

Cites Work

• Cycles in graphs and functional inequalities
• The number of mappings of graphs, an ordering of graphs, and Muirhead's theorem
• Bounds for the number of mappings of graphs and for the number of subgraphs
• Estimates of general Mayer graphs. I. Construction of upper bounds for a given graph by means of sets of subgraphs. III. Upper bounds obtained by means of spanning n-trees. IV. On the computation of Gaussian integrals by star-mesh transformation
• Proof of London's conjecture on sums of elements of positive matrices
• The sum of the elements of the powers of a matrix
• Two inequalities in nonnegative symmetric matrices
• Inequalities in probability theory and turán-type problems for graphs with colored vertices
• Inequalities for functionals generated by bipartite graphs
• A MATRIX INEQUALITY
• A Holder Type Inequality for Symmetric Matrices with Nonnegative Entries
• Three observations on nonnegative matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item