TxGraffiti's independence–matching conjecture for regular graphs
Let be a connected -regular graph with . Let denote the independence number of , and let denote its matching number. TxGraffiti's independence–matching conjecture. Then
and this bound is sharp. This is a generalized form of the example conjecture produced by the filtering heuristic, illustrating how a more general graph hypothesis can be retained for the same sharp inequality.
References
Status
- Solved: Yair Caro, José D. Dávila, and R. Pepper. Conjectures of TxGraffiti: Independence, domination, and matchings (Australasian Journal of Combinatorics, 2020) https://ajc.maths.uq.edu.au/v84.p258
Source: Randy Davila, “Artificial intelligence and machine learning generated conjectures with TxGraffiti”, arXiv:2407.02731 (2024).
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.