On an equivalence in discrete extremal problems

DOI10.1016/S0012-365X(99)00013-8zbMath0932.05044MaRDI QIDQ1301649

Sergei 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)

Related Items (5)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Edge-isoperimetric inequalities in the grid
• Contributions to the geometry of Hamming spaces
• Edge isoperimetric theorems for integer point arrays
• Assignment of Numbers to Vertices
• A generalization of a combinatorial theorem of macaulay
• Optimal Assignments of Numbers to Vertices

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