Timeline for Graphs with only disjoint perfect matchings
Current License: CC BY-SA 3.0
23 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 15, 2017 at 16:10 | history | edited | Mario Krenn | CC BY-SA 3.0 |
added info about useage of question
|
| S Aug 11, 2017 at 13:42 | history | bounty ended | Mario Krenn | ||
| S Aug 11, 2017 at 13:42 | history | notice removed | Mario Krenn | ||
| Aug 11, 2017 at 13:13 | vote | accept | Mario Krenn | ||
| S Aug 4, 2017 at 11:48 | history | bounty started | Mario Krenn | ||
| S Aug 4, 2017 at 11:48 | history | notice added | Mario Krenn | Improve details | |
| Aug 4, 2017 at 11:28 | history | edited | Mario Krenn | CC BY-SA 3.0 |
added 71 characters in body
|
| Aug 3, 2017 at 19:33 | vote | accept | Mario Krenn | ||
| Aug 7, 2017 at 18:30 | |||||
| Aug 3, 2017 at 19:07 | vote | accept | Mario Krenn | ||
| Aug 3, 2017 at 19:11 | |||||
| Apr 19, 2017 at 12:15 | vote | accept | Mario Krenn | ||
| Aug 3, 2017 at 19:07 | |||||
| Apr 13, 2017 at 7:32 | comment | added | Mario Krenn | @DavidRicherby Thank you, that makes perfect sense, I changed the title now accordingly. | |
| Apr 13, 2017 at 7:31 | history | edited | Mario Krenn | CC BY-SA 3.0 |
changed title from distinct -> disjoined, as suggested by Yuzhou Gu
|
| Apr 12, 2017 at 22:21 | comment | added | David Richerby | @Nico Two objects are disjoint if they have empty intersection; they are distinct if they are different. | |
| Apr 12, 2017 at 15:17 | answer | added | Timothy Chow | timeline score: 12 | |
| Apr 12, 2017 at 15:03 | answer | added | Ilya Bogdanov | timeline score: 22 | |
| Apr 12, 2017 at 14:08 | comment | added | Mario Krenn | @YuzhouGu I am interested in graphs with perfect matchings, where every edge only appears in at most one of the perfect matchings. I don't know whether that's the same as "disjoined" perfect matchings. (That is the reason why I asked "How are such graphs called?") Are those called "disjoined perfect matchings"? Thank you! | |
| Apr 12, 2017 at 14:01 | comment | added | Mario Krenn | @TonyHuynh Thank you for your answer, the UPM-graphs are interesting, i haven't thought about that. Are you aware also of examples for many distinct perfect matchings? | |
| Apr 12, 2017 at 14:01 | comment | added | Yuzhou Gu | Do you mean disjoint perfect matchings rather than distinct? | |
| Apr 12, 2017 at 13:59 | comment | added | Mario Krenn | @GordonRoyle Thank you, this is an example which fits my question 2. Your comment is certainly interesting for me. Mainly I am interested in graphs with many distinct perfect matchings, in particular question 3. But i suspect m=3 is the limit. I should specify that, thank you! | |
| Apr 12, 2017 at 13:55 | history | edited | Mario Krenn | CC BY-SA 3.0 |
added 8 characters in body
|
| Apr 12, 2017 at 13:38 | comment | added | Tony Huynh | You can get more examples from graphs with exactly one perfect matching. For example, a path with an even number of edges. See this paper link.springer.com/article/10.1007/s00373-014-1463-8 for more on graphs with unique perfect matchings (UPM-graphs) and also this MO question mathoverflow.net/questions/226583/… | |
| Apr 12, 2017 at 13:34 | comment | added | Gordon Royle | I am intrigued as to the purpose of your first sentence about letting $G(V,E)$ be a graph, given that you never use $G$ or $V$ or indeed $E$ in the remainder. Perhaps more relevantly, if you delete an edge from $K_4$, does this give you another example? You have the cycle $C_4$ doing all the work, and a diagonal edge not appearing in any perfect matchings. | |
| Apr 12, 2017 at 13:11 | history | asked | Mario Krenn | CC BY-SA 3.0 |