Timeline for Local-global approach to graph theory
Current License: CC BY-SA 2.5
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 1, 2010 at 1:38 | comment | added | Harrison Brown | @dan petersen: I think it all depends on how you look at it. Certainly there are nonplanar graphs with large planar subgraphs, but I can specify 5 or 6 vertices and the crucial thing is that they're connected by disjoint paths. It's instructive, too, to look at planarity testing algorithms... | |
| Dec 31, 2009 at 12:43 | comment | added | Dan Petersen | I find it really puzzling that you guys would consider planarity a local property! Obviously a non-planar graph can have arbitrarily large planar subgraphs. And I don't see why circle-packings or forbidden minors are any more local. | |
| Dec 31, 2009 at 7:35 | history | edited | Harrison Brown | CC BY-SA 2.5 |
added 1053 characters in body
|
| Dec 31, 2009 at 7:18 | comment | added | Gjergji Zaimi | Thanks for the answer! This is a fundamental example, and even though I like to think of planarity per se as a global property, its characterizations in terms of circle-packings or forbidden minors are local in nature. | |
| Dec 31, 2009 at 7:07 | history | answered | Harrison Brown | CC BY-SA 2.5 |