Decomposing dense bipartite graphs into 4-cycles

作者:Cavenagh Nicholas J*
来源:Electronic Journal of Combinatorics, 2015, 22(1): P1.50.
DOI:10.37236/3444

摘要

Let G be an even bipartite graph with partite sets X and Y such that vertical bar Y vertical bar is even and the minimum degree of a vertex in Y is at least 95 vertical bar X vertical bar/96. Suppose furthermore that the number of edges in G is divisible by 4. Then G decomposes into 4-cycles.

  • 出版日期2015-2-25