Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Given a graph $G$, I would like to determine a method for randomly generating subgraphs $G'$ with the following properties:

  1. Each edge of $G$ has at least some probability $p$ of going into $G'$

  2. The tree-width of $G'$ is bounded.

I would like to find a method of generating $G'$ so that $p$ is as large as possible. Note that any $p = 1/n$ is possible. if you select a random spanning tree. Are there larger values of $p$ which are possible to achieve?

share|improve this question
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.