Maximal total length of \(k\) disjoint cycles in bitpartite graphs (Q2387188)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2201522
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximal total length of \(k\) disjoint cycles in bitpartite graphs |
scientific article; zbMATH DE number 2201522 |
Statements
Maximal total length of \(k\) disjoint cycles in bitpartite graphs (English)
0 references
26 January 2006
0 references
Let \(k\), \(s\) and \(n\) be three integers with \(s\geq k\geq 2\), \(n\geq 2k+1\). Let \(G=(V_1,V_2;E)\) be a bipartite graph with \(| V_1| =| V_2| =n\). In the paper it is proved that if the minimum degree of \(G\) is at least \(s+1\), then \(G\) contains \(k\) vertex-disjoint cycles covering at least \(\min(2n,4s)\) vertices of \(G\).
0 references
minimum degree
0 references
0.917389988899231
0 references
0.9165745377540588
0 references
0.8756892681121826
0 references
0.875483512878418
0 references
0.8753287196159363
0 references
