Timeline for What are some good examples of non-monotone graph properties?
Current License: CC BY-SA 2.5
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 9, 2011 at 2:01 | comment | added | j.c. | Thanks! As I've been thinking recently about rigidity of graph embeddings, the overlapping terminology threw me for a loop. (Infinitesimal) rigidity in the other sense is determined by the rank of a matroid, and hence is monotone. | |
| Mar 8, 2011 at 16:28 | comment | added | Joel David Hamkins | A mathematical structure is rigid if it has no nontrivial automorphisms. This property is not monotone on graphs, since there are rigid graphs, but neither the empty graph nor the complete graph is rigid (when there are at least two vertices). | |
| Mar 8, 2011 at 15:47 | comment | added | j.c. | Can you clarify "the property of being rigid" a bit more? | |
| Sep 28, 2010 at 0:48 | history | edited | Joel David Hamkins | CC BY-SA 2.5 |
added 222 characters in body
|
| Sep 28, 2010 at 0:38 | history | edited | Joel David Hamkins | CC BY-SA 2.5 |
added 83 characters in body; added 7 characters in body; edited body
|
| Sep 28, 2010 at 0:31 | history | answered | Joel David Hamkins | CC BY-SA 2.5 |