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

An Asymptotic Independence Theorem for the Number of Matchings in Graphs

โœ Scribed by Elmar Teufl; Stephan Wagner

Publisher
Springer Japan
Year
2009
Tongue
English
Weight
172 KB
Volume
25
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The rainbow number of matchings in regul
The rainbow number of matchings in regular bipartite graphs
โœ Xueliang Li; Zhixia Xu ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 386 KB

Given a graph G and a subgraph H of G, let rb(G, H) be the minimum number r for which any edge-coloring of G with r colors has a rainbow subgraph H. The number rb(G, H) is called the rainbow number of H with respect to G. Denote as mK 2 a matching of size m and as B n,k the set of all the k-regular

An asymptotic formula for the number of
An asymptotic formula for the number of graphs having small diameter
โœ Ioan Tomescu ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 351 KB

In this paper it is shown that for every fixed k 1> 3, G(n; d = k) = 2(~) (6.2 -k + o(1))", where G(n; d = k) denotes the number of graphs of order n and diameter equal to k. It is also proved that for every fixed k>~2, lim,~G(n;d=k)/G(n;d=k+ 1)=lim.o~G(n;d=n-k)/ G(n;d=n-k+ 1)= oo hold.

The independence number of an edge-chrom
The independence number of an edge-chromatic critical graph
โœ Douglas R. Woodall ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 77 KB ๐Ÿ‘ 1 views

A graph G with maximum degree and edge chromatic number (G)> is edge--critical if (G -e) = for every edge e of G. It is proved here that the vertex independence number of an edge--critical graph of order n is less than 3 5 n. For large , this improves on the best bound previously known, which was ro