Determinantal factorization conjecture for R-disjoint graphs
Statement
Let be an -disjoint graph. Write for its bipartite part, and for each odd cycle of , let denote the subgraph associated with . Determinantal factorization conjecture. Then
The product is taken over all odd cycles of . The paper proves this factorization for the broader class of BAB-graphs, so the stated conjecture is verified for the particular case of -disjoint graphs.
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.