On vertex-disjoint complete bipartite subgraphs in a bipartite graph (Q1808722)
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 1369709
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On vertex-disjoint complete bipartite subgraphs in a bipartite graph |
scientific article; zbMATH DE number 1369709 |
Statements
On vertex-disjoint complete bipartite subgraphs in a bipartite graph (English)
0 references
16 February 2000
0 references
It is proved that if \(G=(X,Y;E)\) is a bipartite graph with \(|X|=|Y|=4s\), \(s\geq 2\), and the minimum degree of \(G\) is at least \(4s-3\), then \(G\) contains four vertex-disjoint copies of \(K_{s,s}\).
0 references
bipartite graph
0 references
regular factor
0 references
0.8697232604026794
0 references
0.8570267558097839
0 references
0.8479082584381104
0 references
