𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Tight Lower Bounds on the Size of a Maximum Matching in a Regular Graph

✍ Scribed by Michael A. Henning; Anders Yeo

Publisher
Springer Japan
Year
2007
Tongue
English
Weight
106 KB
Volume
23
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A tight lower bound on the maximum genus
A tight lower bound on the maximum genus of a simplicial graph
✍ Jianer Chen; Saroja P. Kanchi; Jonathan L. Gross πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 856 KB

It is proved that every connected simplicial graph with minimum valence at least three has maximum genus at least one-quarter of its cycle rank. This follows from the technical result that every 3-regular simplicial graph except K4 has a Xuong co-tree whose odd components have only one edge each. It

Bounds on the lower size of A 7-critical
Bounds on the lower size of A 7-critical graph
✍ Huanping Liu; Zhongfu Zhang; Dean Shen πŸ“‚ Article πŸ“… 1994 πŸ› Institute of Applied Mathematics, Chinese Academy 🌐 English βš– 307 KB
Forbidden subgraphs and bounds on the si
Forbidden subgraphs and bounds on the size of a maximum matching
✍ Michael D. Plummer; Akira Saito πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 126 KB πŸ‘ 1 views

## Abstract Let __K__~1,__n__~ denote the star on __n__ + 1 vertices; that is, __K__~1,__n__~ is the complete bipartite graph having one vertex in the first vertex class of its bipartition and __n__ in the second. The special graph __K__~1,3~, called the __claw__, has received much attention in the