Conţinutul numărului revistei 
Articolul precedent 
Articolul urmator 
792 5 
Ultima descărcare din IBN: 20210619 21:35 
Căutarea după subiecte similare conform CZU 
519.179.1:004 (1) 
Analiză combinatorică. Teoria grafurilor (100) 
Știința și tehnologia calculatoarelor. Calculatoare. Procesarea datelor (3021) 
SM ISO690:2012 SLUTZKY, David; VOLOSHIN, Vitaly. The Chromatic Spectrum of a Ramsey Mixed
Hypergraph. In: Computer Science Journal of Moldova. 2016, nr. 2(71), pp. 213233. ISSN 15614042. 
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core 
Computer Science Journal of Moldova  
Numărul 2(71) / 2016 / ISSN 15614042  


CZU: 519.179.1:004  
Pag. 213233 



Descarcă PDF  
Rezumat  
We extend known structural theorems, primarily a result of Axenovich and Iverson, for the strict edge colorings of the complete graph Kn which avoid monochromatic and rainbow triangles to discover recursive relationships between the chromatic spectra of the bihypergraphs modeling this coloring problem. In so doing, we begin a systematic study of coloring properties of mixed hypergraphs derived from coloring the edges of a complete graph Kn in such a way that there are no rainbow copies of Kr and no monochromatic copies of Km, where n > r > 3, n > m > 3. We present the chromatic spectra of the bihypergraph models of Kn for 4 6 n 6 12 and r = m = 3. This study fits in the larger context of investigating mixed hypergraph structures that realize given spectral values, as well as investigations of the sufficiency of the spectral coefficients in obtaining recursive relationships without the need to subdivide them further into terms that count finer distinctions in the feasible partitions of the hypergraph. The bihypergraphs arising in this simplest case where r = m = 3 have spectra that are gap free and which do allow a recursive relationship, albeit a complicated one. The continuation of this project in future work will examine if both of these facts remain true for derived Ramsey Mixed Hypergraphs corresponding to larger r and m. 

Cuvintecheie Ramsey number, antiramsey number, mixed hypergraph coloring, feasible partition, chromatic spectrum. 


Dublin Core Export
<?xml version='1.0' encoding='utf8'?> <oai_dc:dc xmlns:dc='http://purl.org/dc/elements/1.1/' xmlns:oai_dc='http://www.openarchives.org/OAI/2.0/oai_dc/' xmlns:xsi='http://www.w3.org/2001/XMLSchemainstance' xsi:schemaLocation='http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd'> <dc:creator>Slutzky, D.</dc:creator> <dc:creator>Voloshin, V.</dc:creator> <dc:date>20160825</dc:date> <dc:description xml:lang='en'>We extend known structural theorems, primarily a result of Axenovich and Iverson, for the strict edge colorings of the complete graph Kn which avoid monochromatic and rainbow triangles to discover recursive relationships between the chromatic spectra of the bihypergraphs modeling this coloring problem. In so doing, we begin a systematic study of coloring properties of mixed hypergraphs derived from coloring the edges of a complete graph Kn in such a way that there are no rainbow copies of Kr and no monochromatic copies of Km, where n > r > 3, n > m > 3. We present the chromatic spectra of the bihypergraph models of Kn for 4 6 n 6 12 and r = m = 3. This study fits in the larger context of investigating mixed hypergraph structures that realize given spectral values, as well as investigations of the sufficiency of the spectral coefficients in obtaining recursive relationships without the need to subdivide them further into terms that count finer distinctions in the feasible partitions of the hypergraph. The bihypergraphs arising in this simplest case where r = m = 3 have spectra that are gap free and which do allow a recursive relationship, albeit a complicated one. The continuation of this project in future work will examine if both of these facts remain true for derived Ramsey Mixed Hypergraphs corresponding to larger r and m. </dc:description> <dc:source>Computer Science Journal of Moldova 71 (2) 213233</dc:source> <dc:subject>Ramsey number</dc:subject> <dc:subject>antiramsey number</dc:subject> <dc:subject>mixed hypergraph coloring</dc:subject> <dc:subject>feasible partition</dc:subject> <dc:subject>chromatic spectrum.</dc:subject> <dc:title>The Chromatic Spectrum of a Ramsey Mixed Hypergraph</dc:title> <dc:type>info:eurepo/semantics/article</dc:type> </oai_dc:dc>