A lower bound for the Randić index in terms of matching number
Let be a graph, let denote its Randić index, and let denote its matching number.
Randić-index matching conjecture. If
then
for some absolute constant .
The paper proves the corresponding asymptotic lower bound for graphs having a nearly-perfect matching and conjectures that the same order of growth holds for all graphs.
References
2 papers in this index state this conjecture (2016–2024). The statement above is taken from the most recent of them; the others are arXiv:1607.08258.
Source: Saieed Akbari, Sina Ghasemi Nezhad, Reyhane Ghazizadeh, John Haslegrave and Elahe Tohidi, “Lower bounds for the Randić index in terms of matching number”, arXiv:2402.12884 (2024).
Progress summary
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.