Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

DM
1999

favoriteEmaildiscussreport

61views more DM 1999»

On an equivalence in discrete extremal problems

13 years 4 months ago

On an equivalence in discrete extremal problems

Download mcs.uwsuper.edu

We introduce some equivalence relations on graphs and posets and prove that they are closed under the cartesian product operation. These relations concern the edge-isoperimetric problem on graphs and the shadow minimization problems on posets. For a long time these problems have been considered quite independently. We present close connections between them. In particular we show that a number of known results concerning the edge-isoperimetric problem for concrete families of graphs are direct consequences of the Macauleyness of appropriate posets.

Sergei L. Bezrukov

Real-time Traffic

Cartesian Product Operation | DM 1999 | Edge-isoperimetric Problem | Shadow Minimization Problems |

claim paper

Related Content

» Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short ...

» DiscreteLogBased Signatures May Not Be Equivalent to Discrete Log

» Minimizing Sparse Higher Order Energy Functions of Discrete Variables

» Problems and results in extremal combinatorics II

» Extremal problems on triangle areas in two and three dimensions

» Extreme point characterizations for infinite network flow problems

» Design Validations for Discrete Logarithm Based Signature Schemes

» Differential Equations for Roaming Pseudospectra Paths to Extremal Points and Boundary Tra...

» New LFSRBased Cryptosystems and the Trace Discrete Log Problem TraceDLP

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	1999
Where	DM
Authors	Sergei L. Bezrukov

Comments (0)