TL;DR
This paper characterizes all finite Gallai multigraphs, which are complete edge-colored graphs without rainbow triangles, by providing a comprehensive construction method.
Contribution
It introduces a complete construction for all finite Gallai multigraphs, filling a gap in the understanding of their structure.
Findings
Provides a construction method for all finite Gallai multigraphs
Characterizes Gallai multigraphs as those without rainbow triangles
Enhances understanding of edge-colored graph structures
Abstract
A complete edge-colored graph or multigraph is called Gallai if it lacks rainbow triangles. We give a construction of all finite Gallai multigraphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsChina's Ethnic Minorities and Relations