The Chromatic Spectrum of a Ramsey Mixed Hypergraph
We extend known structural theorems, primarily a result of Axenovich and Iverson, for the strict edge colorings of the complete graph $K_n$ which avoid monochromatic and rainbow triangles to discover recursive relationships between the chromatic spectra of the bihypergraphs modeling this coloring p...
Main Authors: | David Slutzky, Vitaly Voloshin |
---|---|
Format: | Article |
Language: | English |
Published: |
Vladimir Andrunachievici Institute of Mathematics and Computer Science
2016-08-01
|
Series: | Computer Science Journal of Moldova |
Subjects: | |
Online Access: | http://www.math.md/files/csjm/v24-n2/v24-n2-(pp213-233).pdf |
Similar Items
-
A class of Ramsey-extremal hypergraphs
by: Brendan D. McKay
Published: (2017-09-01) -
Chromatic Spectrum of $K_s$-WORM Colorings of $K_n$
by: Julian A.D. Allagan, et al.
Published: (2020-09-01) -
Decomposing hypergraphs into k-colorable hypergraphs
by: Gholamreza Omidi, et al.
Published: (2014-06-01) -
Chromatic Polynomials of Mixed Hypercycles
by: Allagan Julian A., et al.
Published: (2014-08-01) -
K3-Worm Colorings of Graphs: Lower Chromatic Number and Gaps in the Chromatic Spectrum
by: Bujtás Csilla, et al.
Published: (2016-08-01)