On the number of edge-disjoint triangles in K4K_4-free graphs

preprint2015arXivOpen access

Abstract

We show the quarter of a century old conjecture that every K4K_4-free graph with nn vertices and ⌊n2/4⌋+k\lfloor n^2/4 \rfloor +k edges contains kk pairwise edge disjoint triangles.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.