Teschner's bondage number conjecture

is the bondage number of a graph always less than or equal to 3/2 times its maximum degree?

Open the “Miscellaneous graph theory” section on Wikipedia →

Source: List of unsolved problems in mathematics (CC BY-SA 4.0)