1,987 research outputs found
Sufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles
Given a simple graph , a subset of is called a triangle cover if
it intersects each triangle of . Let and denote the
maximum number of pairwise edge-disjoint triangles in and the minimum
cardinality of a triangle cover of , respectively. Tuza conjectured in 1981
that holds for every graph . In this paper, using a
hypergraph approach, we design polynomial-time combinatorial algorithms for
finding small triangle covers. These algorithms imply new sufficient conditions
for Tuza's conjecture on covering and packing triangles. More precisely,
suppose that the set of triangles covers all edges in . We
show that a triangle cover of with cardinality at most can be
found in polynomial time if one of the following conditions is satisfied: (i)
, (ii) , (iii)
.
Keywords: Triangle cover, Triangle packing, Linear 3-uniform hypergraphs,
Combinatorial algorithm
Min-Max Theorems for Packing and Covering Odd -trails
We investigate the problem of packing and covering odd -trails in a
graph. A -trail is a -walk that is allowed to have repeated
vertices but no repeated edges. We call a trail odd if the number of edges in
the trail is odd. Let denote the maximum number of edge-disjoint odd
-trails, and denote the minimum size of an edge-set that
intersects every odd -trail.
We prove that . Our result is tight---there are
examples showing that ---and substantially improves upon
the bound of obtained in [Churchley et al 2016] for .
Our proof also yields a polynomial-time algorithm for finding a cover and a
collection of trails satisfying the above bounds.
Our proof is simple and has two main ingredients. We show that (loosely
speaking) the problem can be reduced to the problem of packing and covering odd
-trails losing a factor of 2 (either in the number of trails found, or
the size of the cover). Complementing this, we show that the
odd--trail packing and covering problems can be tackled by exploiting
a powerful min-max result of [Chudnovsky et al 2006] for packing
vertex-disjoint nonzero -paths in group-labeled graphs
Some results on triangle partitions
We show that there exist efficient algorithms for the triangle packing
problem in colored permutation graphs, complete multipartite graphs,
distance-hereditary graphs, k-modular permutation graphs and complements of
k-partite graphs (when k is fixed). We show that there is an efficient
algorithm for C_4-packing on bipartite permutation graphs and we show that
C_4-packing on bipartite graphs is NP-complete. We characterize the cobipartite
graphs that have a triangle partition
QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs
A (unit) disk graph is the intersection graph of closed (unit) disks in the plane. Almost three decades ago, an elegant polynomial-time algorithm was found for Maximum Clique on unit disk graphs [Clark, Colbourn, Johnson; Discrete Mathematics '90]. Since then, it has been an intriguing open question whether or not tractability can be extended to general disk graphs. We show the rather surprising structural result that a disjoint union of cycles is the complement of a disk graph if and only if at most one of those cycles is of odd length. From that, we derive the first QPTAS and subexponential algorithm running in time 2^{O~(n^{2/3})} for Maximum Clique on disk graphs. In stark contrast, Maximum Clique on intersection graphs of filled ellipses or filled triangles is unlikely to have such algorithms, even when the ellipses are close to unit disks. Indeed, we show that there is a constant ratio of approximation which cannot be attained even in time 2^{n^{1-epsilon}}, unless the Exponential Time Hypothesis fails
- …