Ticket #13280 (needs_work enhancement)
Extend SubgraphSearch class
|Reported by:||vdelecroix||Owned by:||vdelecroix|
|Component:||graph theory||Keywords:||graph, subgraph, search, subsets|
|Authors:||Vincent Delecroix||Merged in:|
In ask-sagemath.org (question 133) one asked the following question. Given a collection of sets how do I find a subcollection with prescribed intersections cardinality between its members. The natural way to do this is through a subgraph search but the current implementation does not allow that problem to be solved.
The patch reimplement the main method of the class SubgraphSearch? adding options that allow to solve the abolve problem. An instance of the above problem is written in the documentation of sage.graphs.generic_graph.search_subgraph method.