Packing triangles in a graph and its complement

DOI10.1002/jgt.20031zbMath1055.05056OpenAlexW4245354437MaRDI QIDQ3159377

Peter Keevash, Benjamin Sudakov

Publication date: 16 February 2005

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20031

zbMATH Keywords

coloringfractional packingmonochromatic triangles

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (8)

Regarding two conjectures on clique and biclique partitions ⋮ The number of edge-disjoint transitive triples in a tournament ⋮ Clique coverings and claw-free graphs ⋮ On the number of edges not covered by monochromatic copies of a fixed graph. ⋮ On edges not in monochromatic copies of a fixed bipartite graph ⋮ Packing Cliques in Graphs with Independence Number 2 ⋮ Many disjoint triangles in co-triangle-free graphs ⋮ Packing Triangles in Regular Tournaments

Cites Work

• Unnamed Item

This page was built for publication: Packing triangles in a graph and its complement