The Delta Conjecture for maximum nullity of graphs
Statement
Let be a simple graph, and let denote its minimum degree. The maximum nullity is the greatest nullity among matrices associated with in the maximum nullity problem. Delta Conjecture. For every simple graph ,
The conjecture arose in combinatorial matrix theory and is a lower bound on maximum nullity. It is known for all bipartite graphs and for complements of bipartite graphs, but the source does not report a complete resolution.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.