Timeline for Graph to Bipartite conversion preserving number of perfect matchings
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 6, 2017 at 12:32 | history | edited | Peter Heinig | CC BY-SA 3.0 |
Added some considerations and explanations on definability questions ("Can vathing be defined as a class function on the proper class of all finite graphs?") which are rather off-thread, yet which I think should be added.
|
| Sep 5, 2017 at 19:03 | history | edited | Peter Heinig | CC BY-SA 3.0 |
Added a new version of an extended comment, following a comment of the OP.
|
| Sep 4, 2017 at 10:57 | comment | added | Turbo | you can just repost what you had (that was good enough for people to see what had been done before). yeah the grammar is bad (but I believe pigeonhole is very important topic and probably the central topic). | |
| Sep 4, 2017 at 10:51 | comment | added | Turbo | yes I would like to have them here. | |
| Sep 4, 2017 at 10:50 | comment | added | Peter Heinig | Dear @777: thanks for clarifying your view on the word 'trick'. I did not take so much offense on the comment, rather I found this whole attempt of mine, with its badly drawn 'heuristic' illustrations too unseemly to leave it visible for long. If you need to see them again, please say so, and I will make a better one. Yet I think that Wilson-vertex-splittings, while certainly relevant to mention and interesting because of its exact preservation of the number of perfect matchings, will not help, as you already said, because the number of odd-circuit remains unaffected. | |
| Sep 4, 2017 at 9:42 | comment | added | Turbo | 'trick' does not mean 'bad trick' and everything in math essentially tricking pigeonhole into good use and nevertheless the 'tricks' you mentioned will not work. | |
| Aug 30, 2017 at 6:28 | comment | added | Peter Heinig | @777: for more than the following three reasons: (0) you qualified it as a "trick", (1) Wilson's vertex splitting operation, while having the interesting property of exactly preserving the number of perfect matchings, also has the (in this case: rather undesirable) property of exactly preserving the number of odd circuits, i.e., in a sense is maximally unhelpful in getting closer to a bipartite graph, (2) the illustrations I produce were good enough for communication but not nice enough to be left visible for long, to my taste. | |
| Aug 30, 2017 at 1:09 | comment | added | Turbo | why delete old one? | |
| Aug 29, 2017 at 14:13 | history | answered | Peter Heinig | CC BY-SA 3.0 |