๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On maximum number of edges in a spanning eulerian subgraph

โœ Scribed by Dengxin Li; Deying Li; Jingzhong Mao

Book ID
108315903
Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
168 KB
Volume
274
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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.

The number of edges in a subgraph of a H
The number of edges in a subgraph of a Hamming graph
โœ R. Squier; B. Torrence; A. Vogt ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 363 KB

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.

Maximum number of edges joining vertices
Maximum number of edges joining vertices on a cube
โœ Khaled A.S. Abdel-Ghaffar ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 84 KB

Let E d (n) be the number of edges joining vertices from a set of n vertices on a d-dimensional cube, maximized over all such sets. We show that E d (n) = r-1 i=0 (l i /2 + i)2 l i , where r and l 0 > l 1 > โ€ข โ€ข โ€ข > l r-1 are nonnegative integers defined by n = r-1 i=0 2 l i .