✦ LIBER ✦

The maximum number of Kj-subgraphs in a graph with k independent edges

✍ Scribed by Robert James Douglas

Publisher: Elsevier Science
Year: 1977
Tongue: English
Weight: 173 KB
Volume: 23
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(77)90040-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the maximum number of independent edg

On the maximum number of independent edges in cubic graphs

✍ Arthur M. Hobbs; Edward Schmeichel 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 146 KB

Let the reals be extended to include oo with o~ > r

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 Density of Subgraphs in a Graph w

On the Density of Subgraphs in a Graph with Bounded Independence Number

✍ Pavel Valtr 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 260 KB

Let \_(n, m, k) be the largest number \_ # [0, 1] such that any graph on n vertices with independence number at most m has a subgraph on k vertices with at lest \_ } ( k 2 ) edges. Up to a constant multiplicative factor, we determine \_(n, m, k) for all n, m, k. For log n m=k n, our result gives \_(

Maximum number of edges in connected gra

Maximum number of edges in connected graphs with a given domination number

✍ Laura A. Sanchis 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 519 KB

Sanchis, L.A., Maximum number of edges in connected graphs with a given domination number, Discrete Mathematics 87 (1991) 65-72.

The maximum number of edges in a minimal

The maximum number of edges in a minimal graph of diameter 2

✍ Zoltán Füredi 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 717 KB

## Abstract A graph __g__ of diameter 2 is minimal if the deletion of any edge increases its diameter. Here the following conjecture of Murty and Simon is proved for __n__ < __n__~o~. If __g__ has __n__ vertices then it has at most __n__^2^/4 edges. The only extremum is the complete bipartite graph

On the Maximum Number of Independent Cyc

On the Maximum Number of Independent Cycles in a Bipartite Graph

✍ Hong Wang 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 404 KB

Let G=(V 1 , V 2 ; E ) be a bipartite graph with |V 1 |= |V 2 | =n 2k, where k is a positive integer. Suppose that the minimum degree of G is at least k+1. We show that if n>2k, then G contains k vertex-disjoint cycles. We also show that if n=2k, then G contains k&1 quadrilaterals and a path of orde