← All problems

Behsaz–Hatami–Mahmoodian's minimum vertex-cover conjecture for generalized Petersen graphs

16 years old · traced to

Let P(n,k)P(n,k) be the generalized Petersen graph, and let β(P(n,k))\beta(P(n,k)) denote the size of a minimum vertex cover. Behsaz–Hatami–Mahmoodian's conjecture. For all nn and kk,

β(P(n,k))≤n+⌈n5⌉.\beta(P(n,k))\leq n+\left\lceil\frac{n}{5}\right\rceil.
References

Status

Source: Nazli Besharati, J. Ebrahimi B and A. Azadi, “Independence number of generalized Petersen graphs”, arXiv:1008.2583 (2011).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.