Edge-colorings of \(K_{m,n}\) which forbid multicolored cycles (Q2848790)
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 6212226
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Edge-colorings of \(K_{m,n}\) which forbid multicolored cycles |
scientific article; zbMATH DE number 6212226 |
Statements
26 September 2013
0 references
edge coloring
0 references
multicolored cycle
0 references
complete bipartite graph
0 references
Edge-colorings of \(K_{m,n}\) which forbid multicolored cycles (English)
0 references
A subgraph in an edge-colored graph is multicolored if all its edges receive distinct colors. In this paper, the authors study the proper edge colorings of the complete bipartite graph \(K_{m, n}\) which forbid multicolored cycles. It is proved that for any integer \(k \geq 2\), if \(n \geq 5k - 6\), then any properly \(n\)-edge colored \(K_{k, n}\) contains a multicolored \(C_{2k}\). The authors also determine the order of the properly edge-colored complete bipartite graphs which forbid multicolored \(C_6\).
0 references
0.8505648374557495
0 references
0.8412116765975952
0 references
0.8398147225379944
0 references
0.8330827951431274
0 references
