Morphisms for the maximum weight ideal problem

DOI10.1006/JCTA.2000.3100MaRDI QIDQ1584660zbMATH OpenOpenAlexFDO

Authors Lawrence H. Harper

Publication date 17 May 2001

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/705ae8139de00e406161e30bddeac3621c92aa76

zbMATH Keywords

edge-isoperimetric problemmaximum weight ideal problemmorphism

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Extremal problems in graph theory (05C35)

Review text

The author defines a notion of morphism for the maximum weight ideal problem. He then applies this to solve the edge-isoperimetric problem on the graphs of regular solids and their products.

Recommendations

• The edge-isoperimetric problem on the 600-vertex regular solid
• scientific article; zbMATH DE number 2060183
• The Maximum Solution Problem on Graphs
• scientific article; zbMATH DE number 2188353
• Polytopes determined by hypergraph classes

Cites work

• Isoperimetric Inequalities in Mathematical Physics. (AM-27)
• Optimal numberings and isoperimetric problems on graphs

Cited in

(3)

• The edge-isoperimetric problem on the 600-vertex regular solid
• Morphisms for resistive electrical networks
• A new approach to Macaulay posets

This page was built for publication: Morphisms for the maximum weight ideal problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584660)