HIGHLIGHTS
- who: Math. Subj. Class. and collaborators from the Department of Mathematics and Computer Science, Faculty of Science, Chulalongkorn University, Bangkok, Thailand have published the research work: On the existence of zero-sum perfect matchings of complete graphs, in the Journal: (JOURNAL)
SUMMARY
For any 2-edge-colouring of K4n with an equal number of edges of each colour, there exists a matching with an equal number of edges of each colour. For M ∈ M(G), if there are more red edges than black edges in E(VR (M ), VB (M )), then the authors . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.