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

Binding number and minimum degree for the existence of (g,f,n)-critical graphs

โœ Scribed by Hongxia Liu; Guizhen Liu

Book ID
107619774
Publisher
Springer-Verlag
Year
2008
Tongue
English
Weight
292 KB
Volume
29
Category
Article
ISSN
1598-5865

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A degree condition for the existence of
A degree condition for the existence of regular factors inK1,n-free graphs
โœ Ota, Katsuhiro; Tokuda, Taro ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 260 KB ๐Ÿ‘ 2 views

A graph is called K1,.-free if it contains no K l , n as an induced subgraph. Let n ( r 3), r be integers (if r is odd, r 2 n -1). We prove that every Kl,,-free connected graph G with rlV(G)I even has an r-factor if its minimum degree is at least This degree condition is sharp.

Problem 142. : The symmetric genus of a
Problem 142. : The symmetric genus of a group G is the minimum genus of a surface on which G acts. Let An denote the alternating group of degree n, ฮณG denote the genus of the group G, and ฯƒ(G) the symmetric genus of G. Is the following conjecture true? Conjecture: For at least one n, ฮณ(An)<ฯƒ(An)?
๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 50 KB

## Reseirrch problems Problem 142. The symmetric genus of a group G is the minimum genus of a surface on which G acts. Let A, denote the alternating group of degree n, y(G) denote the genus of the group G, and a(G) the symmetric genus of G. Is the following conjecture true? Conjecture: For at leas