Timeline for Scott topology, but for graphs
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 22 at 14:09 | history | edited | gmvh |
Added top-level tag
|
|
| May 22 at 12:33 | history | edited | Jukka Kohonen | CC BY-SA 4.0 |
tag fix (order lattices) etc.
|
| Jun 25, 2011 at 12:52 | answer | added | Joel David Hamkins | timeline score: 3 | |
| Jun 24, 2011 at 19:15 | comment | added | Mikola | I suppose you could build the nerve of a graph and use that as a topology, but it won't be the same thing as the Scott topology in the case of the graph of some arbitrary partial order, for example. I guess the answer is that "yes, you can define many topologies", but the real question is which is the most useful one for your applications? Probably the closest notion to a continuous map for graphs would be a graph homomorphism, but you don't really need a topology to define that.. | |
| Jun 24, 2011 at 19:09 | history | asked | Ben Sprott | CC BY-SA 3.0 |