✦ LIBER ✦

Regular factors in regular graphs

✍ Scribed by P. Katerinis

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 473 KB
Volume: 113
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90523-v

No coin nor oath required. For personal study only.

✦ Synopsis

Katerinis, P., Regular factors in regular graphs, Discrete Mathematics 113 (1993) 269-274.

Let G be a k-regular, (k -I)-edge-connected graph with an even number of vertices, and let m be an integer such that 1~ m s k -1. Then the graph obtained by removing any k -m edges of G, has an m-factor.

📜 SIMILAR VOLUMES

Regular factors in nearly regular graphs

✍ Jean-Claude Bermond; Michel Las Vergnas 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 232 KB

Regular factors in vertex-deleted subgra

Regular factors in vertex-deleted subgraphs of regular graphs

✍ P. Katerinis 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 258 KB

Let G be a 2r-regular, 2r-edge-connected graph of odd order and m be an integer such that 1 2rw(W)+2ec(S',S')-2 c d,-&)+2rlS'I. ES' (12) But CxsS' ## dc-o(x)=&sS dG-D(x)+dc-&)=CXEs dG,-D(x)+e&,S)+dG-&). Thus (12) implies, ## 2rIDI>2ro(W)+2eG(S',S')-2 c dc,-o(x)+e,(u,S)+d,-,(u) +WS'I. XC.7

2-factors in random regular graphs

✍ Robalewska, Hanna D. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 474 KB 👁 3 views

In this paper the expectation and variance of the number of 2-factors in random r-regular graphs for any fixed r 2 3 is analyzed and the asymptotic distribution of this variable is determined.

Regular factors in K1,3-free graphs

✍ S. A. Choudum; M. S. Paulraj 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 247 KB 👁 1 views

## Abstract We show that every connected __K__~1,3~‐free graph with minimum degree at least __2k__ contains a __k__‐factor and construct connected __K__~1,3~‐free graphs with minimum degree __k__ + __0__(√__k__) that have no __k__‐factor.

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

Regular factors in K1,n free graphs

✍ Yoshimi Egawa; Katsuhiro Ota 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 280 KB

## Abstract A graph is said to be __K__~1,__n__~‐free, if it contains no __K__~1,__n__~ as an induced subgraph. We prove that for __n__ ⩾ 3 and __r__ ⩾ __n__ −1, if __G__ is a __K__~1,__n__~‐free graph with minimum degree at least (__n__^2^/4(__n__ −1))__r__ + (3__n__ −6)/2 + (__n__ −1)/4__r__, the