The corona–kernel bound for graphs with odd cycles
Let be a graph. Write for its corona, \textnormal{\ker}(G) for its kernel, and let denote its independence number. Let be the number of odd cycles in .
Corona–kernel conjecture. For every graph ,
\left|\textnormal{corona}(G)\right|+\left|\textnormal{\ker}(G)\right|\le 2\alpha(G)+k.This conjecture extends the corresponding equality and inequality phenomena for corona and core in König–Egerváry graphs and general graphs. Its resolution is not indicated in the supplied text.
References
2 papers in this index state this conjecture (2026). The statement above is taken from the most recent of them; the others are arXiv:2603.10315.
Source: Adrián Pastine and Kevin Pereyra, “Inequalities Involving Core, Corona, and Critical Sets in General Graphs”, arXiv:2603.10316 (2026).
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.