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., the connected components of maximal monochromatic subgraphs, of exact Gallai graphs. The first characterization is in terms of their reduced form, a notion which hinges on the important idea of a full homomorphism. The second characterization is by means of a homomorphism duality.
Recommendations
Cites work
- scientific article; zbMATH DE number 863494 (Why is no real title available?)
- Edge colorings of complete graphs without tricolored triangles
- Edge-colored complete graphs with precisely colored subgraphs
- Lambda composition
- On classes of relations and graphs determined by subobjects and factorobjects
- On lengths of rainbow cycles
- Transitiv orientierbare Graphen
Cited in
(12)- Periods in missing lengths of rainbow cycles
- On exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems
- Dualities in full homomorphisms
- Not complementary connected and not CIS \(d\)-graphs form weakly monotone families
- Connected colourings of complete graphs and hypergraphs
- Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
- Rainbow generalizations of Ramsey theory: A survey
- Gallai colorings and domination in multipartite digraphs
- scientific article; zbMATH DE number 6750761 (Why is no real title available?)
- Extensions of Gallai-Ramsey results
- A decomposition of Gallai multigraphs
- Complete edge-colored permutation graphs
This page was built for publication: Colored graphs without colorful cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q949751)
