Applied Mathematics LettersVolume 14, Issue 6, August 2001, Pages 701-705The number of edges in a subgraph of a Hamming graphAuthor links open overlay panelR. Squier, B. Torrence, A. VogtShow moreShareCitehttps://doi.org/10.1016/S0893-9659(01)80030-6Get rights and contentUnder an Elsevier user licenseopen archiveAbstractLet G be a subgraph of the Cartesian product Hamming graph (Kp)r with n vertices. Then the number of edges of G is at most (12)(p − 1) logp n, with equality holding if and only G is isomorphic to (Kp)s for some s ≤ r.Previous article in issueNext article in issueKeywordsAverage sizeMaximum sizeCompletely decomposableRecommended articlesCited by (0)Copyright © 2001 Published by Elsevier Ltd.