On colorings avoiding a rainbow cycle and a fixed monochromatic subgraph

zbMATH Open1215.05051MaRDI QIDQ2380463FDOQ2380463

Authors: Jihyeok Choi, Maria Axenovich 

Publication date: 26 March 2010

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/226100

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• scientific article; zbMATH DE number 5995288
• Edge-colorings avoiding rainbow and monochromatic subgraphs
• Edge Colorings of K(m,n) with m+n-1 Colors Which Forbid Rainbow Cycles
• Some rainbow cycles in \(r\)-good edge-colorings
• Local Anti-Ramsey Numbers of Graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Cited In (7)

• On colorings of the Boolean lattice avoiding a rainbow copy of a poset
• On the maximal colorings of complete graphs without some small properly colored subgraphs
• Gallai-Ramsey numbers for a class of graphs with five vertices
• Edge Colorings of K(m,n) with m+n-1 Colors Which Forbid Rainbow Cycles
• Rainbow generalizations of Ramsey theory: A survey
• A note on the monotonicity of mixed Ramsey numbers
• Avoiding rainbow induced subgraphs in vertex-colorings

This page was built for publication: On colorings avoiding a rainbow cycle and a fixed monochromatic subgraph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380463)