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

Counting 1-factors in infinite graphs

โœ Scribed by Ron Aharoni; Mao Lin Zheng

Book ID
103500669
Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
627 KB
Volume
50
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Counting 1-Factors in Regular Bipartite
Counting 1-Factors in Regular Bipartite Graphs
โœ Alexander Schrijver ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 325 KB

We show that any k-regular bipartite graph with 2n vertices has at least \ (k&1) k&1 k k&2 + n perfect matchings (1-factors). Equivalently, this is a lower bound on the permanent of any nonnegative integer n\_n matrix with each row and column sum equal to k. For any k, the base (k&1) k&1 ร‚k k&2 is l

Infinite paths in planar graphs III, 1-w
Infinite paths in planar graphs III, 1-way infinite paths
โœ Xingxing Yu ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 336 KB

An infinite graph is 2-indivisible if the deletion of any finite set of vertices from the graph results in exactly one infinite component. Let G be a 4-connected, 2-indivisible, infinite, plane graph. It is known that G contains a spanning 1-way infinite path. In this paper, we prove a stronger resu

Counting patterns in graphs
Counting patterns in graphs
โœ Guido Guardabassi ๐Ÿ“‚ Article ๐Ÿ“… 1972 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 326 KB
Counting Matchings in Graphs
Counting Matchings in Graphs
โœ E.J. Farrell ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 488 KB

A general formula is derivedfor the matching polynomial of an arbitrary graph G. This yields a methodfor counting matchings in graphs. From the general formula, explicit formulae are deducedfor the number of k-matchings in several well-known families of graphs.