Sets of Lattice Points which Contain a Maximal Number of Edges

DOI10.2307/2037250zbMath0216.02001OpenAlexW4232603943MaRDI QIDQ5619110

G. F. Clements

Publication date: 1971

Full work available at URL: https://doi.org/10.2307/2037250

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items

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 ⋮ Edge-isoperimetric inequalities in the grid ⋮ Contributions to the geometry of Hamming spaces ⋮ Low order polynomial bounds on the expected performance of local improvement algorithms ⋮ More on the generalized Macaulay theorem ⋮ Inequalities concerning numbers of subsets of a finite set

Cites Work

• Unnamed Item
• Assignment of Numbers to Vertices
• Maximally Connected Arrays on the n-Cube
• The number of s-dimensional faces in a complex: An analogy between the simplex and the cube
• A generalization of a combinatorial theorem of macaulay
• Optimal Assignments of Numbers to Vertices