Tuza's Conjecture for Threshold Graphs
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...
Збережено в:
| Автори: | , , , , , , |
|---|---|
| Формат: | Artigo |
| Мова: | Inglês |
| Опубліковано: |
Discrete Mathematics & Theoretical Computer Science
2022-08-01
|
| Серія: | Discrete Mathematics & Theoretical Computer Science |
| Предмети: | |
| Онлайн доступ: | https://dmtcs.episciences.org/7660/pdf |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|