Timeline for Generating non-isomorphic graphs by adding edges to a given graph
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:19 | history | edited | CommunityBot |
replaced http://math.stackexchange.com/ with https://math.stackexchange.com/
|
|
| Apr 24, 2015 at 19:42 | history | edited | Ricardo Andrade | CC BY-SA 3.0 |
remved misspelled tag 'canonical-labellling'
|
| Jan 18, 2013 at 8:32 | vote | accept | Jernej | ||
| Jan 17, 2013 at 11:49 | answer | added | Brendan McKay | timeline score: 3 | |
| Jan 17, 2013 at 11:30 | comment | added | Jernej | @BrendanMcKay the base graph has an automorphism group of order 2^85 * 3^32 * 5^16 * 7^16 | |
| Jan 17, 2013 at 9:59 | comment | added | Brendan McKay | If this is feasible, you must have a very large automorphism group. How large is it? | |
| Jan 16, 2013 at 19:22 | comment | added | Gerhard Paseman | You certainly may ask. If you have already asked, please remind me again at the previous email address. If you haven't, my registered user page mathoverflow.net/users/3206/gerhard-paseman has a portion of my address. I will have sometime this weekend to post a reply. If you do want all noniso extensions, then it makes sense to consider edges not connecting A to B. Perhaps life would be just as good if you considered just those isomorphisms having A and B as stable sets? Gerhard "Try Being A Smart Brute" Paseman, 2013.01.16 | |
| Jan 16, 2013 at 18:55 | comment | added | Jernej | @GerhardPaseman A and B are indeed disjoint. And there are no edges between! I don't see any reasons why such a matching would not exists since $B$ is larger then $A.$ Yes, all I really want are nonisomorphic extensions that match $A$ to $B$. BTW, may I ask you about system designs? | |
| Jan 16, 2013 at 16:54 | comment | added | Gerhard Paseman | Are A and B disjoint? Do they start with any edges between them? Do you need to consider anything outside the subgraph of G induced by the vertices in the union of A and B? What do you have in G that suggests a matching of the desired kind is possible? Why should isomorphism classes matter at all (or do you really want all or most nonisomorphic extensions that match A to B)? Gerhard "Ask Me About System Design" Paseman, 2013.01.16 | |
| Jan 16, 2013 at 16:00 | history | edited | Jernej | CC BY-SA 3.0 |
edited body
|
| Jan 16, 2013 at 13:29 | history | asked | Jernej | CC BY-SA 3.0 |