4,833 research outputs found
Packing and Covering Triangles in Bilaterally-Complete Tripartite Graphs
We use Menger's Theorem and K\"onig's Line Colouring Theorem to show that in
any tripartite graph with two complete (bipartite) sides the maximum number of
pairwise edge-disjoint triangles equals the minimum number of edges that meet
all triangles. This generalizes the corresponding result for complete
tripartite graphs given by Lakshmanan, et al.Comment: 8 pages, 4 figure
Induced cycles in triangle graphs
The triangle graph of a graph , denoted by , is the graph
whose vertices represent the triangles ( subgraphs) of , and two
vertices of are adjacent if and only if the corresponding
triangles share an edge. In this paper, we characterize graphs whose triangle
graph is a cycle and then extend the result to obtain a characterization of
-free triangle graphs. As a consequence, we give a forbidden subgraph
characterization of graphs for which is a tree, a chordal
graph, or a perfect graph. For the class of graphs whose triangle graph is
perfect, we verify a conjecture of the third author concerning packing and
covering of triangles.Comment: 27 page
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
Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs
We study the family of intersection graphs of low density objects in low
dimensional Euclidean space. This family is quite general, and includes planar
graphs. We prove that such graphs have small separators. Next, we present
efficient -approximation algorithms for these graphs, for
Independent Set, Set Cover, and Dominating Set problems, among others. We also
prove corresponding hardness of approximation for some of these optimization
problems, providing a characterization of their intractability in terms of
density
Packing and covering with balls on Busemann surfaces
In this note we prove that for any compact subset of a Busemann surface
(in particular, for any simple polygon with geodesic metric)
and any positive number , the minimum number of closed balls of radius
with centers at and covering the set is at most 19
times the maximum number of disjoint closed balls of radius centered
at points of : , where and
are the covering and the packing numbers of by -balls.Comment: 27 page
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
Maximum weight cycle packing in directed graphs, with application to kidney exchange programs
Centralized matching programs have been established in several countries to organize kidney exchanges between incompatible patient-donor pairs. At the heart of these programs are algorithms to solve kidney exchange problems, which can be modelled as cycle packing problems in a directed graph, involving cycles of length 2, 3, or even longer. Usually, the goal is to maximize the number of transplants, but sometimes the total benefit is maximized by considering the differences between suitable kidneys. These problems correspond to computing cycle packings of maximum size or maximum weight in directed graphs. Here we prove the APX-completeness of the problem of finding a maximum size exchange involving only 2-cycles and 3-cycles. We also present an approximation algorithm and an exact algorithm for the problem of finding a maximum weight exchange involving cycles of bounded length. The exact algorithm has been used to provide optimal solutions to real kidney exchange problems arising from the National Matching Scheme for Paired Donation run by NHS Blood and Transplant, and we describe practical experience based on this collaboration
- âŚ