𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The number of edges in a subgraph of a Hamming graph

✍ Scribed by R. Squier; B. Torrence; A. Vogt

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
363 KB
Volume
14
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

✦ Synopsis

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 (1/2)(p -1) log, n, with equality holding if and only G is isomorphic to (Kp)s for some s 5 r.

πŸ“œ SIMILAR VOLUMES

The number of edges in a maximum cycleβ€”d
The number of edges in a maximum cycleβ€”distributed graph
✍ Yongbing Shi πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 288 KB

Shi, Y., The number of edges in a maximum cycle-distributed graph, Discrete Mathematics 104 (1992) 205-209. Let f(n) (f\*(n)) be the maximum possible number of edges in a graph (2-connected simple graph) on n vertices in which no two cycles prove that, for every integer n > 3, f(n) 3 n + k + [i( [~(

On the maximum number of edges in a c4-f
On the maximum number of edges in a c4-free subgraph of qn
✍ Peter Brass; Heiko Harborth; Hauke Nienborg πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 283 KB πŸ‘ 2 views

For the maximum number f ( n ) of edges in a C4-free subgraph of the n-dimensional cube-graph 0, w e prove f(n) 2 i ( n + f i ) 2 " -' for n = 4f, and f ( n ) 2 i ( n + 0.9,h)2"-' for all n 2 9. This disproves one version of a conjecture of P. Erdos.