On an equivalence in discrete extremal problems

DOI10.1016/S0012-365X(99)00013-8zbMATH Open0932.05044MaRDI QIDQ1301649FDOQ1301649

Authors: Sergej L. Bezrukov 

Publication date: 13 March 2000

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

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

zbMATH Keywords

equivalencechainextremal problems in graphs or posets

Mathematics Subject Classification ID

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

Cites Work

• Contributions to the geometry of Hamming spaces
• Title not available (Why is that?)
• Optimal Assignments of Numbers to Vertices
• Title not available (Why is that?)
• A generalization of a combinatorial theorem of macaulay
• Title not available (Why is that?)
• Edge-isoperimetric inequalities in the grid
• Assignment of Numbers to Vertices
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Edge isoperimetric theorems for integer point arrays
• Title not available (Why is that?)

Cited In (6)

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

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)