Tuza's Conjecture for Threshold Graphs

by   Marthe Bonamy, et al.

Tuza famously conjectured in 1981 that in a graph without k+1 edge-disjoint triangles, it suffices to delete at most 2k edges to obtain a triangle-free graph. The conjecture holds for graphs with small treewidth or small maximum average degree, including planar graphs. However, for dense graphs that are neither cliques nor 4-colorable, only asymptotic results are known. Here, we confirm the conjecture for threshold graphs, i.e. graphs that are both split graphs and cographs, and for co-chain graphs with both sides of the same size divisible by 4.


page 3

page 5

page 7


On Tuza's conjecture for triangulations and graphs with small treewidth

Tuza (1981) conjectured that the size τ(G) of a minimum set of edges tha...

Multi-transversals for Triangles and the Tuza's Conjecture

In this paper, we study a primal and dual relationship about triangles: ...

On Graphs and the Gotsman-Linial Conjecture for d = 2

We give an infinite class of counterexamples to the Gotsman-Linial conje...

WQO dichotomy for 3-graphs

We investigate data-enriched models, like Petri nets with data, where ex...

Jones' Conjecture in subcubic graphs

We confirm Jones' Conjecture for subcubic graphs. Namely, if a subcubic ...

The Gotsman-Linial Conjecture is False

In 1991, Craig Gotsman and Nathan Linial conjectured that for all n and ...

Strengthening the Murty-Simon conjecture on diameter 2 critical graphs

A graph is diameter-2-critical if its diameter is 2 but the removal of a...