✦ LIBER ✦

On the number of trees having k edges in common with a graph of bounded degrees

✍ Scribed by Ioan Tomescu

Book ID: 108316063
Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 128 KB
Volume: 169
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(96)00111-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The maximum number of edges in 2K2-free

The maximum number of edges in 2K2-free graphs of bounded degree

✍ F.R.K. Chung; A. Gyárfás; Z. Tuza; W.T. Trotter 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 481 KB

A graph is 2K,-free if it does not contain an independent pair of edges as an induced subgraph. We show that if G is 2K,-free and has maximum degree A(G) = D, then G has at most 5D2/4 edges if D is even. If D is odd, this bound can be improved to (5D\* -20 + 1)/4. The extremal graphs are unique.

New bounds on the edge number of a k-map

New bounds on the edge number of a k-map graph

✍ Zhi-Zhong Chen 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 310 KB 👁 1 views

## Abstract It is known that for every integer __k__ ≥ 4, each __k__‐map graph with __n__ vertices has at most __kn__ − 2__k__ edges. Previously, it was open whether this bound is tight or not. We show that this bound is tight for __k__ = 4, 5. We also show that this bound is not tight for large en

The maximum number of edges in a graph w

The maximum number of edges in a graph with fixed edge-degree

✍ R.J. Faudree; J. Sheehan 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 633 KB

Suppose that n i> 2t + 2 (t/> 17). Let G be a graph with n vertices such that its complement is connected and, for all distinct non-adjacent vertices u and v, there are at least t common neighbours. Then we prove that and Furthermore, the results are sharp.

An upper bound on the number of edges of

An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree

✍ Lian-ying Miao; Shi-you Pang; Jian-liang Wu 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 100 KB

In this paper, we prove that any edge-coloring critical graph G with maximum degree ¿ (11 + √ 49 -24 )=2, where 6 1, has the size at least 3(|V (G)| -) + 1 if 6 7 or if ¿ 8 and |V (G)| ¿ 2 --4 -( + 6)=( -6), where is the minimum degree of G. It generalizes a result of Sanders and Zhao.

The Number of Vertices of Degree k in a

The Number of Vertices of Degree k in a Minimally k-Edge-Connected Graph

✍ M.C. Cai 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 346 KB

A remark on the number of vertices of de

A remark on the number of vertices of degree k in a minimally k-edge-connected graph

✍ Mao-cheng Cai 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 395 KB

Let G be a minimally k-edge-connected simple graph and u\*(G) be the number of vertices of degree k in G. proved that (i) uk(G) 2 l(jGl -1)/(2k + l)] + k + 1 for even k, and (ii) uI(G) 2 [lGl/(k + l)] + k for odd k 35 and u,(G) 2 lZlGl/(k + l)] + k -2 for odd k 27, where ICI denotes the number of v