Sets of Lattice Points which Contain a Maximal Number of Edges
From MaRDI portal
Cites work
- A generalization of a combinatorial theorem of macaulay
- Assignment of Numbers to Vertices
- scientific article; zbMATH DE number 3189757 (Why is no real title available?)
- Maximally Connected Arrays on the n-Cube
- Optimal Assignments of Numbers to Vertices
- The number of s-dimensional faces in a complex: An analogy between the simplex and the cube
Cited in
(9)- Edge-isoperimetric inequalities in the grid
- Contributions to the geometry of Hamming spaces
- Inequalities concerning numbers of subsets of a finite set
- More on the generalized Macaulay theorem
- Low order polynomial bounds on the expected performance of local improvement algorithms
- Polytopes, graphs, and complexes
- An extremal graph problem on a grid and an isoperimetric problem for polyominoes
- Reflect-push methods. Part I: Two dimensional techniques
- Towards a complete local-global principle
This page was built for publication: Sets of Lattice Points which Contain a Maximal Number of Edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5619110)
