Disjoint color-avoiding triangles

DOI10.1137/060666664MaRDI QIDQ5189508zbMATH OpenOpenAlexFDO

Authors Raphael Yuster

Publication date 17 March 2010

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/060666664

zbMATH Keywords

edge coloringpackingtriangles

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Edge disjoint monochromatic triangles in 2-colored graphs
• Rainbow triangles and cliques in edge-colored graphs
• Edge-disjoint rainbow triangles in edge-colored graphs
• Vertex-disjoint rainbow triangles in edge-colored graphs
• On graphs with a large number of edge-colorings avoiding a rainbow triangle

Cited in

(2)

• Packing triangles in regular tournaments
• On edges not in monochromatic copies of a fixed bipartite graph

This page was built for publication: Disjoint color-avoiding triangles

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