Maximum Matchings and Minimum Blocking Sets in Θ_6-Graphs

by   Therese Biedl, et al.

Θ_6-Graphs are important geometric graphs that have many applications especially in wireless sensor networks. They are equivalent to Delaunay graphs where empty equilateral triangles take the place of empty circles. We investigate lower bounds on the size of maximum matchings in these graphs. The best known lower bound is n/3, where n is the number of vertices of the graph. Babu et al. (2014) conjectured that any Θ_6-graph has a perfect matching (as is true for standard Delaunay graphs). Although this conjecture remains open, we improve the lower bound to (3n-8)/7. We also relate the size of maximum matchings in Θ_6-graphs to the minimum size of a blocking set. Every edge of a Θ_6-graph on point set P corresponds to an empty triangle that contains the endpoints of the edge but no other point of P. A blocking set has at least one point in each such triangle. We prove that the size of a maximum matching is at least β(n)/2 where β(n) is the minimum, over all Θ_6-graphs with n vertices, of the minimum size of a blocking set. In the other direction, lower bounds on matchings can be used to prove bounds on β, allowing us to show that β(n)≥ 3n/4-2.


page 1

page 2

page 3

page 4


Induced 2-degenerate Subgraphs of Triangle-free Planar Graphs

A graph is k-degenerate if every subgraph has minimum degree at most k. ...

Optimal Lower Bounds for Matching and Vertex Cover in Dynamic Graph Streams

In this paper, we give simple optimal lower bounds on the one-way two-pa...

On Tuza's conjecture in co-chain graphs

In 1981, Tuza conjectured that the cardinality of a minimum set of edges...

Lower Bounds on Sparse Spanners, Emulators, and Diameter-reducing shortcuts

We prove better lower bounds on additive spanners and emulators, which a...

Monitoring edge-geodetic sets: hardness and graph products

Foucaud, Krishna and Lekshmi recently introduced the concept of monitori...

Improved Approximation for Maximum Edge Colouring Problem

The anti-Ramsey number, ar(G, H) is the minimum integer k such that in a...

Non-Clashing Teaching Maps for Balls in Graphs

Recently, Kirkpatrick et al. [ALT 2019] and Fallat et al. [JMLR 2023] in...

Please sign up or login with your details

Forgot password? Click here to reset