On an equivalence in discrete extremal problems

DOI10.1016/S0012-365X(99)00013-8MaRDI QIDQ1301649zbMATH OpenFDO

Authors Sergej L. Bezrukov

Publication date 13 March 2000

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

equivalencechainextremal problems in graphs or posets

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorics of partially ordered sets (06A07)

Recommendations

• General edge-isoperimetric inequalities. I: Information-theoretical methods
• General edge-isoperimetric inequalities. II: A local-global principle for lexicographical solutions
• scientific article; zbMATH DE number 2044916

Cites work

• scientific article; zbMATH DE number 3786792 (Why is no real title available?)
• scientific article; zbMATH DE number 3489128 (Why is no real title available?)
• scientific article; zbMATH DE number 1303526 (Why is no real title available?)
• scientific article; zbMATH DE number 1016362 (Why is no real title available?)
• scientific article; zbMATH DE number 6383 (Why is no real title available?)
• scientific article; zbMATH DE number 6447 (Why is no real title available?)
• scientific article; zbMATH DE number 7644614 (Why is no real title available?)
• A generalization of a combinatorial theorem of macaulay
• Assignment of Numbers to Vertices
• Contributions to the geometry of Hamming spaces
• Edge isoperimetric theorems for integer point arrays
• Edge-isoperimetric inequalities in the grid
• Optimal Assignments of Numbers to Vertices

Cited in

(6)

• The spider poset is Macaulay
• Pull-push method: a new approach to edge-isoperimetric problems
• On partitioning of hypergraphs
• Reflect-push methods. Part I: Two dimensional techniques
• On the discrete Fuglede and Pompeiu problems
• A new approach to Macaulay posets

This page was built for publication: On an equivalence in discrete extremal problems

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