Loading...
Thumbnail Image
Item

Decomposing dense bipartite graphs into 4-cycles

Abstract
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.
Type
Journal Article
Type of thesis
Series
Citation
Cavenagh, N. J. (2015). Decomposing dense bipartite graphs into 4-cycles. Electronic Journal of Combinatorics, 22(1).
Date
2015-02-25
Publisher
Electronic Journal of Combinatorics
Degree
Supervisors
Rights
© 2015 the author