Many disjoint triangles in co-triangle-free graphs

DOI10.1017/S096354832000036XzbMath1466.05105arXiv2001.00763MaRDI QIDQ4993125

Mykhaylo Tyomkyn

Publication date: 15 June 2021

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2001.00763

zbMATH Keywords

2-coloringedge disjoint monochromatic complete graphs

Mathematics Subject Classification ID

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

Cites Work

• Integer and fractional packings in dense graphs
• Some recent problems and results in graph theory
• Additive approximation for edge-deletion problems
• Packing triangles in a graph and its complement
• On Sets of Acquaintances and Strangers at any Party
• Packing Cliques in Graphs with Independence Number 2
• Edge disjoint monochromatic triangles in 2-colored graphs

This page was built for publication: Many disjoint triangles in co-triangle-free graphs