Colored graphs without colorful cycles
Richard N. Ball, Ale\v{s} Pultr, Petr Vojt\v{e}chovsk\'y

TL;DR
This paper characterizes colored graphs without colorful cycles, explores the algebraic structure of omitted cycle lengths, and provides structural descriptions of exact Gallai graphs and their monochromatic components.
Contribution
It introduces a new algebraic framework for omitted cycle lengths and characterizes exact Gallai graphs through iterative construction and homomorphism duality.
Findings
Colored graphs without colorful cycles are exactly Gallai graphs.
Omitted cycle lengths form a monoid isomorphic to a submonoid of natural numbers.
Exact Gallai graphs can be built from three simple base graphs.
Abstract
A colored graph is a complete graph in which a color has been assigned to each edge, and a colorful cycle is a cycle in which each edge has a different color. We first show that a colored graph lacks colorful cycles iff it is Gallai, i.e., lacks colorful triangles. We then show that, under the operation , the omitted lengths of colorful cycles in a colored graph form a monoid isomorphic to a submonoid of the natural numbers which contains all integers past some point. We prove that several but not all such monoids are realized. We then characterize exact Gallai graphs, i.e., graphs in which every triangle has edges of exactly two colors. We show that these are precisely the graphs which can be iteratively built up from three simple colored graphs, having , , and vertices, respectively. We then characterize in two different ways the monochromes, i.e.,…
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
TopicsAdvanced Topology and Set Theory · Limits and Structures in Graph Theory · semigroups and automata theory
