<p>Can someone recommend a reference on graph minors structure theorem and sublinear treewidth?  Doesn't have to be the newest/strongest results as long as it's easier than tracking down all the papers written about these results.</p>
<p>Mostly I'm interested in finding the details about the existence of large grid minors in large treewidth planar and minor free graphs and sublinear treewidth of planar and minor free graphs from basic graph theory.</p>

CC BY-SA 4.0
2020-12-27T20:45:21.357Z
The book http://parameterized-algorithms.mimuw.edu.pl/parameterized-algorithms.pdf chapter 7.7
Laakeri
CC BY-SA 4.0
2020-12-27T20:48:00.013Z
@Laakeri I meant covering the proof of sublinear treewidth
Hao S
CC BY-SA 4.0
2020-12-27T23:06:10.767Z
What exactly do you mean by the "proof" of sub-linear treewidth? It is an easy consequence of separator theorems for planar graphs and more generally minor free graphs.
Chandra Chekuri
CC BY-SA 4.0
2020-12-28T23:46:27.793Z
@ChandraChekuri  I guess I mean from reasonably basic graph theory basically anything that's easier than tracking down all the related papers
Hao S
CC BY-SA 4.0
2020-12-29T00:09:24.727Z
You may  find some references here useful. https://cstheory.stackexchange.com/questions/44317/book-recommendation-treewidth
Chandra Chekuri
<graph-theory><planar-graphs><treewidth>
Can someone recommend a reference on graph minors structure theorem and sublinear treewidth?
Hao S
# Can someone recommend a reference on graph minors structure theorem and sublinear treewidth?

(Asked by: username_0 on 2020-12-27)

Can someone recommend a reference on graph minors structure theorem and sublinear treewidth? Doesn't have to be the newest/strongest results as long as it's easier than tracking down all the papers written about these results.

Mostly I'm interested in finding the details about the existence of large grid minors in large treewidth planar and minor free graphs and sublinear treewidth of planar and minor free graphs from basic graph theory.

**Tags:** graph-theory, planar-graphs, treewidth

> **Comments:**
> **username_1**: The book http://parameterized-algorithms.mimuw.edu.pl/parameterized-algorithms.pdf chapter 7.7  
> **username_0**: @username_1 I meant covering the proof of sublinear treewidth  
> **username_2**: What exactly do you mean by the "proof" of sub-linear treewidth? It is an easy consequence of separator theorems for planar graphs and more generally minor free graphs.  
> **username_0**: @ChandraChekuri  I guess I mean from reasonably basic graph theory basically anything that's easier than tracking down all the related papers  
> **username_2**: You may  find some references here useful. https://cstheory.stackexchange.com/questions/44317/book-recommendation-treewidth  

---

## 0 answers

