Decomposing dense bipartite graphs into 4-cycles (Q2260624)
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 6413654
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decomposing dense bipartite graphs into 4-cycles |
scientific article; zbMATH DE number 6413654 |
Statements
Decomposing dense bipartite graphs into 4-cycles (English)
0 references
11 March 2015
0 references
Summary: Let \(G\) be an even bipartite graph with partite sets \(X\) and \(Y\) such that \(|Y|\) is even and the minimum degree of a vertex in \(Y\) is at least \(95|X|/96\). Suppose furthermore that the number of edges in \(G\) is divisible by 4. Then \(G\) decomposes into 4-cycles.
0 references
graph decomposition
0 references
extremal graph theory
0 references
0.8763749003410339
0 references
0.8490623235702515
0 references
0.8250794410705566
0 references
0.8196655511856079
0 references
